./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.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-sp_file-3.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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:01:51,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:01:51,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:01:51,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:01:51,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:01:51,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:01:51,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:01:51,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:01:51,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:01:51,989 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:01:51,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:01:51,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:01:51,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:01:51,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:01:51,990 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:01:51,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:01:51,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:01:51,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:01:51,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:01:51,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:01:51,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:01:51,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:01:51,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:01:51,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:01:51,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:01:51,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:01:51,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:01:51,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:01:51,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:01:51,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:01:51,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:01:51,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:01:51,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:01:51,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:01:51,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:01:51,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:01:51,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:01:51,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:01:51,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:01:51,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:01:51,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:01:51,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:01:51,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:01:51,994 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2025-02-06 04:01:52,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:01:52,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:01:52,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:01:52,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:01:52,275 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:01:52,276 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-sp_file-3.i [2025-02-06 04:01:53,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef9e16266/44d4cf1d7ba741fe9e70df608bed2739/FLAGa34a45164 [2025-02-06 04:01:53,851 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:01:53,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2025-02-06 04:01:53,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef9e16266/44d4cf1d7ba741fe9e70df608bed2739/FLAGa34a45164 [2025-02-06 04:01:54,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef9e16266/44d4cf1d7ba741fe9e70df608bed2739 [2025-02-06 04:01:54,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:01:54,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:01:54,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:01:54,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:01:54,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:01:54,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41511839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54, skipping insertion in model container [2025-02-06 04:01:54,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:01:54,302 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-sp_file-3.i[916,929] [2025-02-06 04:01:54,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:01:54,376 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:01:54,384 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-sp_file-3.i[916,929] [2025-02-06 04:01:54,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:01:54,449 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:01:54,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54 WrapperNode [2025-02-06 04:01:54,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:01:54,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:01:54,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:01:54,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:01:54,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,503 INFO L138 Inliner]: procedures = 30, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 638 [2025-02-06 04:01:54,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:01:54,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:01:54,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:01:54,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:01:54,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,525 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:01:54,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:01:54,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:01:54,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:01:54,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:01:54,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (1/1) ... [2025-02-06 04:01:54,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:01:54,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:54,592 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 04:01:54,594 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 04:01:54,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:01:54,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:01:54,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:01:54,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:01:54,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:01:54,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:01:54,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:01:54,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:01:54,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:01:54,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:01:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:01:54,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:01:54,758 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:01:54,759 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:01:55,293 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~ite115#1;havoc property_#t~ite114#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short112#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~ite123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite140#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~ite179#1;havoc property_#t~mem176#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite151#1;havoc property_#t~mem150#1;havoc property_#t~ite158#1;havoc property_#t~mem152#1;havoc property_#t~ite154#1;havoc property_#t~mem153#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~ite175#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite163#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite167#1;havoc property_#t~mem166#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~ite170#1;havoc property_#t~mem169#1;havoc property_#t~mem171#1;havoc property_#t~ite173#1;havoc property_#t~mem172#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~short180#1; [2025-02-06 04:01:55,350 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-02-06 04:01:55,350 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:01:55,366 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:01:55,366 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:01:55,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:55 BoogieIcfgContainer [2025-02-06 04:01:55,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:01:55,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:01:55,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:01:55,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:01:55,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:01:54" (1/3) ... [2025-02-06 04:01:55,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1232db14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:01:55, skipping insertion in model container [2025-02-06 04:01:55,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:01:54" (2/3) ... [2025-02-06 04:01:55,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1232db14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:01:55, skipping insertion in model container [2025-02-06 04:01:55,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:55" (3/3) ... [2025-02-06 04:01:55,377 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2025-02-06 04:01:55,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:01:55,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-3.i that has 2 procedures, 148 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:01:55,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:01:55,464 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;@4fa4cc68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:01:55,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:01:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 130 states have internal predecessors, (188), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:01:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 04:01:55,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:55,483 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:55,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:55,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1623673690, now seen corresponding path program 1 times [2025-02-06 04:01:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:55,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457573111] [2025-02-06 04:01:55,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:55,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 04:01:55,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 04:01:55,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:55,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 04:01:55,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:55,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457573111] [2025-02-06 04:01:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457573111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:01:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224404937] [2025-02-06 04:01:55,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:55,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:55,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:55,894 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 04:01:55,896 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 04:01:56,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 04:01:56,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 04:01:56,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:56,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:56,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:01:56,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:01:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 04:01:56,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:01:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224404937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:56,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:01:56,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:01:56,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842605568] [2025-02-06 04:01:56,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:56,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:01:56,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:56,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:01:56,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:01:56,222 INFO L87 Difference]: Start difference. First operand has 148 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 130 states have internal predecessors, (188), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:01:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:56,248 INFO L93 Difference]: Finished difference Result 290 states and 451 transitions. [2025-02-06 04:01:56,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:01:56,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-02-06 04:01:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:56,257 INFO L225 Difference]: With dead ends: 290 [2025-02-06 04:01:56,257 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 04:01:56,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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 04:01:56,264 INFO L435 NwaCegarLoop]: 215 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, 215 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 04:01:56,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 04:01:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-06 04:01:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:01:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-02-06 04:01:56,301 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2025-02-06 04:01:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:56,301 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-02-06 04:01:56,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:01:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-02-06 04:01:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 04:01:56,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:56,309 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:56,318 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 04:01:56,510 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 04:01:56,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:56,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 761092878, now seen corresponding path program 1 times [2025-02-06 04:01:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:56,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814896287] [2025-02-06 04:01:56,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:56,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 04:01:56,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 04:01:56,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:56,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 04:01:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814896287] [2025-02-06 04:01:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814896287] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:01:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608505052] [2025-02-06 04:01:57,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:57,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:01:57,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:01:57,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:01:57,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 04:01:57,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 04:01:57,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:57,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:57,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:01:57,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:01:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:01:57,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:01:57,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608505052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:57,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:01:57,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 04:01:57,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685838348] [2025-02-06 04:01:57,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:57,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:01:57,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:57,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:01:57,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:01:57,446 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:01:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:57,492 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2025-02-06 04:01:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:01:57,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-02-06 04:01:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:57,498 INFO L225 Difference]: With dead ends: 289 [2025-02-06 04:01:57,498 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 04:01:57,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:01:57,501 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:57,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:01:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 04:01:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-06 04:01:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:01:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2025-02-06 04:01:57,514 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2025-02-06 04:01:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:57,516 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2025-02-06 04:01:57,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:01:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2025-02-06 04:01:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 04:01:57,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:57,518 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:57,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:01:57,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:01:57,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:57,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1619723276, now seen corresponding path program 1 times [2025-02-06 04:01:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107231805] [2025-02-06 04:01:57,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:57,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 04:01:57,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 04:01:57,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:01:57,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:01:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:01:59,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:01:59,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107231805] [2025-02-06 04:01:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107231805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:01:59,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:01:59,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:01:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030747351] [2025-02-06 04:01:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:01:59,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:01:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:01:59,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:01:59,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:01:59,628 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:01:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:01:59,872 INFO L93 Difference]: Finished difference Result 363 states and 538 transitions. [2025-02-06 04:01:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:01:59,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2025-02-06 04:01:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:01:59,879 INFO L225 Difference]: With dead ends: 363 [2025-02-06 04:01:59,879 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 04:01:59,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:01:59,881 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:01:59,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 655 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:01:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 04:01:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2025-02-06 04:01:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 177 states have internal predecessors, (248), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 04:01:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 312 transitions. [2025-02-06 04:01:59,913 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 312 transitions. Word has length 135 [2025-02-06 04:01:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:01:59,914 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 312 transitions. [2025-02-06 04:01:59,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:01:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 312 transitions. [2025-02-06 04:01:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 04:01:59,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:01:59,921 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:59,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:01:59,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:01:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:01:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1451429257, now seen corresponding path program 1 times [2025-02-06 04:01:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:01:59,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765602695] [2025-02-06 04:01:59,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:01:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:01:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 04:02:00,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 04:02:00,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:00,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 04:02:01,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:01,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765602695] [2025-02-06 04:02:01,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765602695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:01,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598686494] [2025-02-06 04:02:01,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:01,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:01,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:01,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:02:01,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:02:01,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 04:02:01,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 04:02:01,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:01,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:01,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:02:01,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:04,309 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 04:02:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-02-06 04:02:04,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:02:04,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2025-02-06 04:02:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:04,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598686494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:02:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2025-02-06 04:02:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614887647] [2025-02-06 04:02:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:02:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:04,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:02:04,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-06 04:02:04,692 INFO L87 Difference]: Start difference. First operand 212 states and 312 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:05,220 INFO L93 Difference]: Finished difference Result 433 states and 639 transitions. [2025-02-06 04:02:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:02:05,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-02-06 04:02:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:05,224 INFO L225 Difference]: With dead ends: 433 [2025-02-06 04:02:05,224 INFO L226 Difference]: Without dead ends: 289 [2025-02-06 04:02:05,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-02-06 04:02:05,226 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 462 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:05,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1023 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:02:05,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-06 04:02:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 247. [2025-02-06 04:02:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 212 states have (on average 1.4150943396226414) internal successors, (300), 212 states have internal predecessors, (300), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 04:02:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 364 transitions. [2025-02-06 04:02:05,262 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 364 transitions. Word has length 136 [2025-02-06 04:02:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:05,263 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 364 transitions. [2025-02-06 04:02:05,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 364 transitions. [2025-02-06 04:02:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 04:02:05,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:05,265 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:05,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:02:05,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:05,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:05,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -306238105, now seen corresponding path program 1 times [2025-02-06 04:02:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665122675] [2025-02-06 04:02:05,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:05,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 04:02:05,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 04:02:05,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:05,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665122675] [2025-02-06 04:02:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665122675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:02:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585028992] [2025-02-06 04:02:05,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:05,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:02:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:05,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:02:05,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:02:05,579 INFO L87 Difference]: Start difference. First operand 247 states and 364 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:05,628 INFO L93 Difference]: Finished difference Result 537 states and 795 transitions. [2025-02-06 04:02:05,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:02:05,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-02-06 04:02:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:05,631 INFO L225 Difference]: With dead ends: 537 [2025-02-06 04:02:05,631 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 04:02:05,632 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 04:02:05,632 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:05,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 455 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:02:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 04:02:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 306. [2025-02-06 04:02:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 271 states have (on average 1.4354243542435425) internal successors, (389), 271 states have internal predecessors, (389), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 04:02:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 453 transitions. [2025-02-06 04:02:05,672 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 453 transitions. Word has length 136 [2025-02-06 04:02:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:05,672 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 453 transitions. [2025-02-06 04:02:05,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 453 transitions. [2025-02-06 04:02:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 04:02:05,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:05,676 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:05,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:02:05,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:05,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1808772960, now seen corresponding path program 1 times [2025-02-06 04:02:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581323256] [2025-02-06 04:02:05,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:05,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:02:05,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:02:05,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:05,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 04:02:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:05,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581323256] [2025-02-06 04:02:05,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581323256] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:05,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922566912] [2025-02-06 04:02:05,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:05,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:05,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:05,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:02:05,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:02:06,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:02:06,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:02:06,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:06,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:06,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:02:06,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:06,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922566912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:02:06,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 04:02:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029021016] [2025-02-06 04:02:06,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:06,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:02:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:06,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:02:06,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:02:06,180 INFO L87 Difference]: Start difference. First operand 306 states and 453 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:06,221 INFO L93 Difference]: Finished difference Result 546 states and 811 transitions. [2025-02-06 04:02:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:02:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-02-06 04:02:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:06,224 INFO L225 Difference]: With dead ends: 546 [2025-02-06 04:02:06,224 INFO L226 Difference]: Without dead ends: 312 [2025-02-06 04:02:06,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:02:06,225 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:06,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:02:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-06 04:02:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-02-06 04:02:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 273 states have (on average 1.4322344322344323) internal successors, (391), 273 states have internal predecessors, (391), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 04:02:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 455 transitions. [2025-02-06 04:02:06,244 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 455 transitions. Word has length 137 [2025-02-06 04:02:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:06,245 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 455 transitions. [2025-02-06 04:02:06,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 455 transitions. [2025-02-06 04:02:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 04:02:06,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:06,247 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:06,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:02:06,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 04:02:06,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1815831217, now seen corresponding path program 1 times [2025-02-06 04:02:06,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:06,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121852164] [2025-02-06 04:02:06,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:06,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:06,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:02:06,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:02:06,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:06,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:07,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:07,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121852164] [2025-02-06 04:02:07,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121852164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:07,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:07,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:02:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566407619] [2025-02-06 04:02:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:07,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:02:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:07,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:02:07,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:02:07,805 INFO L87 Difference]: Start difference. First operand 308 states and 455 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:08,062 INFO L93 Difference]: Finished difference Result 777 states and 1156 transitions. [2025-02-06 04:02:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:02:08,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2025-02-06 04:02:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:08,066 INFO L225 Difference]: With dead ends: 777 [2025-02-06 04:02:08,066 INFO L226 Difference]: Without dead ends: 541 [2025-02-06 04:02:08,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:02:08,067 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 294 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:08,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 670 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:02:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-06 04:02:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 475. [2025-02-06 04:02:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 423 states have (on average 1.4373522458628842) internal successors, (608), 423 states have internal predecessors, (608), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 04:02:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 704 transitions. [2025-02-06 04:02:08,106 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 704 transitions. Word has length 137 [2025-02-06 04:02:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:08,106 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 704 transitions. [2025-02-06 04:02:08,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 704 transitions. [2025-02-06 04:02:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 04:02:08,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:08,109 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:08,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:02:08,109 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:08,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1034999142, now seen corresponding path program 1 times [2025-02-06 04:02:08,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:08,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554960127] [2025-02-06 04:02:08,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:08,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:08,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 04:02:08,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 04:02:08,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:08,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:08,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:08,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554960127] [2025-02-06 04:02:08,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554960127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:08,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:08,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:02:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551841337] [2025-02-06 04:02:08,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:08,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:02:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:08,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:02:08,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:02:08,864 INFO L87 Difference]: Start difference. First operand 475 states and 704 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:09,421 INFO L93 Difference]: Finished difference Result 915 states and 1357 transitions. [2025-02-06 04:02:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:02:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-02-06 04:02:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:09,425 INFO L225 Difference]: With dead ends: 915 [2025-02-06 04:02:09,425 INFO L226 Difference]: Without dead ends: 679 [2025-02-06 04:02:09,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:02:09,428 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 562 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:09,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 819 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:02:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-06 04:02:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 535. [2025-02-06 04:02:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 483 states have (on average 1.445134575569358) internal successors, (698), 483 states have internal predecessors, (698), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 04:02:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 794 transitions. [2025-02-06 04:02:09,467 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 794 transitions. Word has length 138 [2025-02-06 04:02:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:09,467 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 794 transitions. [2025-02-06 04:02:09,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 794 transitions. [2025-02-06 04:02:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 04:02:09,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:09,470 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:09,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:02:09,470 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:09,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2112925728, now seen corresponding path program 1 times [2025-02-06 04:02:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:09,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799545167] [2025-02-06 04:02:09,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:09,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 04:02:09,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 04:02:09,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:09,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 04:02:09,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:09,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799545167] [2025-02-06 04:02:09,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799545167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:09,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032599070] [2025-02-06 04:02:09,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:09,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:09,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:09,704 INFO L229 MonitoredProcess]: Starting monitored process 6 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 04:02:09,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:02:09,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 04:02:09,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 04:02:09,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:09,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:09,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:02:09,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:10,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032599070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:02:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 04:02:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491362117] [2025-02-06 04:02:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:02:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:10,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:02:10,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:02:10,012 INFO L87 Difference]: Start difference. First operand 535 states and 794 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:10,071 INFO L93 Difference]: Finished difference Result 1004 states and 1493 transitions. [2025-02-06 04:02:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:02:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-02-06 04:02:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:10,077 INFO L225 Difference]: With dead ends: 1004 [2025-02-06 04:02:10,078 INFO L226 Difference]: Without dead ends: 541 [2025-02-06 04:02:10,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:02:10,080 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:10,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:02:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-06 04:02:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-02-06 04:02:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 489 states have (on average 1.4396728016359919) internal successors, (704), 489 states have internal predecessors, (704), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 04:02:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 800 transitions. [2025-02-06 04:02:10,126 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 800 transitions. Word has length 138 [2025-02-06 04:02:10,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:10,126 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 800 transitions. [2025-02-06 04:02:10,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 800 transitions. [2025-02-06 04:02:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 04:02:10,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:10,128 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:10,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:02:10,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:10,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:10,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash -337626228, now seen corresponding path program 1 times [2025-02-06 04:02:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:10,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869392528] [2025-02-06 04:02:10,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:10,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 04:02:10,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 04:02:10,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:10,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869392528] [2025-02-06 04:02:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869392528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:02:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227659126] [2025-02-06 04:02:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:02:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:10,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:02:10,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:02:10,993 INFO L87 Difference]: Start difference. First operand 541 states and 800 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:11,413 INFO L93 Difference]: Finished difference Result 990 states and 1461 transitions. [2025-02-06 04:02:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:02:11,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-02-06 04:02:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:11,417 INFO L225 Difference]: With dead ends: 990 [2025-02-06 04:02:11,417 INFO L226 Difference]: Without dead ends: 691 [2025-02-06 04:02:11,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:02:11,420 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 581 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:11,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 935 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:02:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-02-06 04:02:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 601. [2025-02-06 04:02:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 549 states have (on average 1.4462659380692167) internal successors, (794), 549 states have internal predecessors, (794), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 04:02:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 890 transitions. [2025-02-06 04:02:11,463 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 890 transitions. Word has length 138 [2025-02-06 04:02:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 890 transitions. [2025-02-06 04:02:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 890 transitions. [2025-02-06 04:02:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 04:02:11,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:11,466 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:11,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:02:11,466 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:11,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash -476994462, now seen corresponding path program 1 times [2025-02-06 04:02:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158909663] [2025-02-06 04:02:11,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:11,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 04:02:11,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 04:02:11,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:11,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158909663] [2025-02-06 04:02:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158909663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:11,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:11,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:02:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756577798] [2025-02-06 04:02:11,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:11,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:02:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:11,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:02:11,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:02:11,555 INFO L87 Difference]: Start difference. First operand 601 states and 890 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:11,637 INFO L93 Difference]: Finished difference Result 1207 states and 1782 transitions. [2025-02-06 04:02:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:02:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2025-02-06 04:02:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:11,643 INFO L225 Difference]: With dead ends: 1207 [2025-02-06 04:02:11,643 INFO L226 Difference]: Without dead ends: 678 [2025-02-06 04:02:11,645 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 04:02:11,645 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 104 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:11,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:02:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-06 04:02:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 574. [2025-02-06 04:02:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 522 states have (on average 1.4233716475095786) internal successors, (743), 522 states have internal predecessors, (743), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 04:02:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 839 transitions. [2025-02-06 04:02:11,682 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 839 transitions. Word has length 139 [2025-02-06 04:02:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:11,683 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 839 transitions. [2025-02-06 04:02:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 839 transitions. [2025-02-06 04:02:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 04:02:11,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:11,685 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:11,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:02:11,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:11,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash 818777004, now seen corresponding path program 1 times [2025-02-06 04:02:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139755508] [2025-02-06 04:02:11,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:11,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:11,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 04:02:11,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 04:02:11,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:11,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139755508] [2025-02-06 04:02:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139755508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:14,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 04:02:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471800335] [2025-02-06 04:02:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:14,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 04:02:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:14,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 04:02:14,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:02:14,138 INFO L87 Difference]: Start difference. First operand 574 states and 839 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:15,581 INFO L93 Difference]: Finished difference Result 1331 states and 1943 transitions. [2025-02-06 04:02:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:02:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 139 [2025-02-06 04:02:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:15,587 INFO L225 Difference]: With dead ends: 1331 [2025-02-06 04:02:15,587 INFO L226 Difference]: Without dead ends: 829 [2025-02-06 04:02:15,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-06 04:02:15,589 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 523 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:15,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1940 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 04:02:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-02-06 04:02:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 740. [2025-02-06 04:02:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 688 states have (on average 1.430232558139535) internal successors, (984), 688 states have internal predecessors, (984), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 04:02:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1080 transitions. [2025-02-06 04:02:15,654 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1080 transitions. Word has length 139 [2025-02-06 04:02:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:15,654 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1080 transitions. [2025-02-06 04:02:15,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1080 transitions. [2025-02-06 04:02:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 04:02:15,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:15,657 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:15,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:02:15,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:15,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -978174355, now seen corresponding path program 1 times [2025-02-06 04:02:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992119870] [2025-02-06 04:02:15,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:15,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:15,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 04:02:15,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 04:02:15,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:15,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992119870] [2025-02-06 04:02:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992119870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:16,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:16,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:02:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524571143] [2025-02-06 04:02:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:16,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:02:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:16,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:02:16,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:02:16,517 INFO L87 Difference]: Start difference. First operand 740 states and 1080 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:17,009 INFO L93 Difference]: Finished difference Result 1536 states and 2233 transitions. [2025-02-06 04:02:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:02:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-02-06 04:02:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:17,013 INFO L225 Difference]: With dead ends: 1536 [2025-02-06 04:02:17,013 INFO L226 Difference]: Without dead ends: 868 [2025-02-06 04:02:17,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:02:17,016 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 512 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:17,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 790 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:02:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-02-06 04:02:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 864. [2025-02-06 04:02:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 793 states have (on average 1.4148802017654476) internal successors, (1122), 795 states have internal predecessors, (1122), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 04:02:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1250 transitions. [2025-02-06 04:02:17,073 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1250 transitions. Word has length 139 [2025-02-06 04:02:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:17,073 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1250 transitions. [2025-02-06 04:02:17,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1250 transitions. [2025-02-06 04:02:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 04:02:17,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:17,076 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:17,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:02:17,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:17,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash 409952779, now seen corresponding path program 1 times [2025-02-06 04:02:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019517563] [2025-02-06 04:02:17,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:17,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 04:02:17,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 04:02:17,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:17,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:17,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:17,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019517563] [2025-02-06 04:02:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019517563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:17,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:02:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218333875] [2025-02-06 04:02:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:02:17,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:17,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:02:17,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:02:17,801 INFO L87 Difference]: Start difference. First operand 864 states and 1250 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:18,386 INFO L93 Difference]: Finished difference Result 1831 states and 2649 transitions. [2025-02-06 04:02:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:02:18,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-02-06 04:02:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:18,394 INFO L225 Difference]: With dead ends: 1831 [2025-02-06 04:02:18,394 INFO L226 Difference]: Without dead ends: 1043 [2025-02-06 04:02:18,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:02:18,396 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 276 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:18,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 928 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:02:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2025-02-06 04:02:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 922. [2025-02-06 04:02:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 851 states have (on average 1.4159811985898942) internal successors, (1205), 853 states have internal predecessors, (1205), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 04:02:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1333 transitions. [2025-02-06 04:02:18,462 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1333 transitions. Word has length 139 [2025-02-06 04:02:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:18,462 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1333 transitions. [2025-02-06 04:02:18,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1333 transitions. [2025-02-06 04:02:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 04:02:18,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:18,464 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:18,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:02:18,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:18,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1386998580, now seen corresponding path program 1 times [2025-02-06 04:02:18,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:18,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155293333] [2025-02-06 04:02:18,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:18,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 04:02:18,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 04:02:18,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:20,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:20,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155293333] [2025-02-06 04:02:20,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155293333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:20,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:20,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 04:02:20,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334828286] [2025-02-06 04:02:20,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:20,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 04:02:20,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:20,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 04:02:20,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:02:20,876 INFO L87 Difference]: Start difference. First operand 922 states and 1333 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:22,176 INFO L93 Difference]: Finished difference Result 1852 states and 2680 transitions. [2025-02-06 04:02:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:02:22,177 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 139 [2025-02-06 04:02:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:22,181 INFO L225 Difference]: With dead ends: 1852 [2025-02-06 04:02:22,181 INFO L226 Difference]: Without dead ends: 1006 [2025-02-06 04:02:22,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-02-06 04:02:22,184 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 264 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:22,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 2116 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 04:02:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-02-06 04:02:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 917. [2025-02-06 04:02:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 846 states have (on average 1.41725768321513) internal successors, (1199), 848 states have internal predecessors, (1199), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 04:02:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1327 transitions. [2025-02-06 04:02:22,247 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1327 transitions. Word has length 139 [2025-02-06 04:02:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:22,247 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1327 transitions. [2025-02-06 04:02:22,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1327 transitions. [2025-02-06 04:02:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 04:02:22,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:22,250 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:02:22,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:22,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1910221506, now seen corresponding path program 1 times [2025-02-06 04:02:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937497661] [2025-02-06 04:02:22,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:22,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 04:02:22,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 04:02:22,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:22,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:24,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937497661] [2025-02-06 04:02:24,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937497661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:24,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:24,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 04:02:24,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10479157] [2025-02-06 04:02:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:24,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:02:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:24,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:02:24,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:02:24,347 INFO L87 Difference]: Start difference. First operand 917 states and 1327 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:25,415 INFO L93 Difference]: Finished difference Result 1682 states and 2433 transitions. [2025-02-06 04:02:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 04:02:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 140 [2025-02-06 04:02:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:25,420 INFO L225 Difference]: With dead ends: 1682 [2025-02-06 04:02:25,420 INFO L226 Difference]: Without dead ends: 1173 [2025-02-06 04:02:25,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2025-02-06 04:02:25,422 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 813 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:25,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1428 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:02:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-02-06 04:02:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 978. [2025-02-06 04:02:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 907 states have (on average 1.420066152149945) internal successors, (1288), 909 states have internal predecessors, (1288), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 04:02:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1416 transitions. [2025-02-06 04:02:25,499 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1416 transitions. Word has length 140 [2025-02-06 04:02:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:25,500 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1416 transitions. [2025-02-06 04:02:25,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1416 transitions. [2025-02-06 04:02:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 04:02:25,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:25,502 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:25,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:02:25,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash -936801953, now seen corresponding path program 1 times [2025-02-06 04:02:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:25,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563033119] [2025-02-06 04:02:25,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:25,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 04:02:25,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 04:02:25,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:25,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563033119] [2025-02-06 04:02:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563033119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:02:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723311074] [2025-02-06 04:02:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:27,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:02:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:27,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:02:27,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:02:27,410 INFO L87 Difference]: Start difference. First operand 978 states and 1416 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:28,072 INFO L93 Difference]: Finished difference Result 1656 states and 2393 transitions. [2025-02-06 04:02:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:02:28,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2025-02-06 04:02:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:28,077 INFO L225 Difference]: With dead ends: 1656 [2025-02-06 04:02:28,077 INFO L226 Difference]: Without dead ends: 1086 [2025-02-06 04:02:28,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:02:28,079 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 367 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:28,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 776 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:02:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-02-06 04:02:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1082. [2025-02-06 04:02:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1001 states have (on average 1.4115884115884116) internal successors, (1413), 1005 states have internal predecessors, (1413), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 04:02:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1557 transitions. [2025-02-06 04:02:28,170 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1557 transitions. Word has length 140 [2025-02-06 04:02:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:28,170 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1557 transitions. [2025-02-06 04:02:28,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1557 transitions. [2025-02-06 04:02:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 04:02:28,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:28,174 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:28,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:02:28,174 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:28,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1832936321, now seen corresponding path program 1 times [2025-02-06 04:02:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:28,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994344040] [2025-02-06 04:02:28,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:28,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:28,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 04:02:28,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 04:02:28,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:28,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 04:02:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:29,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994344040] [2025-02-06 04:02:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994344040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:29,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465002729] [2025-02-06 04:02:29,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:29,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:02:29,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:29,459 INFO L229 MonitoredProcess]: Starting monitored process 7 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 04:02:29,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 04:02:29,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 04:02:29,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 04:02:29,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:29,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-06 04:02:29,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:29,872 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 49 treesize of output 48 [2025-02-06 04:02:30,044 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 108 treesize of output 78 [2025-02-06 04:02:30,374 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 15 treesize of output 1 [2025-02-06 04:02:30,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:31,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:31,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:31,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:32,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:32,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:32,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:32,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:02:33,080 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 60 treesize of output 42 [2025-02-06 04:02:33,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 58 [2025-02-06 04:02:33,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2025-02-06 04:02:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 152 proven. 93 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 04:02:33,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:02:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465002729] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:02:33,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:02:33,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-02-06 04:02:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745111075] [2025-02-06 04:02:33,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:02:33,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 04:02:33,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:33,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 04:02:33,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=551, Unknown=12, NotChecked=0, Total=650 [2025-02-06 04:02:33,451 INFO L87 Difference]: Start difference. First operand 1082 states and 1557 transitions. Second operand has 21 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2025-02-06 04:02:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:36,619 INFO L93 Difference]: Finished difference Result 2585 states and 3681 transitions. [2025-02-06 04:02:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 04:02:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) Word has length 142 [2025-02-06 04:02:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:36,625 INFO L225 Difference]: With dead ends: 2585 [2025-02-06 04:02:36,626 INFO L226 Difference]: Without dead ends: 1523 [2025-02-06 04:02:36,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=753, Invalid=3141, Unknown=12, NotChecked=0, Total=3906 [2025-02-06 04:02:36,629 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2137 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:36,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 1973 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 04:02:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-02-06 04:02:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 988. [2025-02-06 04:02:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 931 states have (on average 1.4070891514500536) internal successors, (1310), 935 states have internal predecessors, (1310), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 04:02:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1402 transitions. [2025-02-06 04:02:36,721 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1402 transitions. Word has length 142 [2025-02-06 04:02:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:36,722 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1402 transitions. [2025-02-06 04:02:36,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2025-02-06 04:02:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1402 transitions. [2025-02-06 04:02:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 04:02:36,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:36,724 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:36,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 04:02:36,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 04:02:36,928 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:36,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 57607685, now seen corresponding path program 1 times [2025-02-06 04:02:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290516307] [2025-02-06 04:02:36,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:36,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 04:02:36,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 04:02:36,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:36,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:38,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:38,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290516307] [2025-02-06 04:02:38,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290516307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:38,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:38,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:02:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118319355] [2025-02-06 04:02:38,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:38,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:02:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:38,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:02:38,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:02:38,341 INFO L87 Difference]: Start difference. First operand 988 states and 1402 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:39,248 INFO L93 Difference]: Finished difference Result 1854 states and 2627 transitions. [2025-02-06 04:02:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:02:39,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142 [2025-02-06 04:02:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:39,256 INFO L225 Difference]: With dead ends: 1854 [2025-02-06 04:02:39,256 INFO L226 Difference]: Without dead ends: 1246 [2025-02-06 04:02:39,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:02:39,258 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 604 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:39,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1124 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 04:02:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-02-06 04:02:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1055. [2025-02-06 04:02:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1001 states have (on average 1.4115884115884116) internal successors, (1413), 1004 states have internal predecessors, (1413), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 04:02:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1501 transitions. [2025-02-06 04:02:39,398 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1501 transitions. Word has length 142 [2025-02-06 04:02:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:39,399 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1501 transitions. [2025-02-06 04:02:39,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:39,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1501 transitions. [2025-02-06 04:02:39,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 04:02:39,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:39,401 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:39,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 04:02:39,401 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:39,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash 144990053, now seen corresponding path program 1 times [2025-02-06 04:02:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:39,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615925029] [2025-02-06 04:02:39,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:39,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:39,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:02:39,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:02:39,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:39,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:02:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615925029] [2025-02-06 04:02:40,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615925029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:40,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:40,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:02:40,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438208919] [2025-02-06 04:02:40,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:40,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:02:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:02:40,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:02:40,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:02:40,775 INFO L87 Difference]: Start difference. First operand 1055 states and 1501 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:41,422 INFO L93 Difference]: Finished difference Result 2151 states and 3054 transitions. [2025-02-06 04:02:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:02:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 143 [2025-02-06 04:02:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:41,427 INFO L225 Difference]: With dead ends: 2151 [2025-02-06 04:02:41,428 INFO L226 Difference]: Without dead ends: 1099 [2025-02-06 04:02:41,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:02:41,430 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 581 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:41,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 867 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:02:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-06 04:02:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1013. [2025-02-06 04:02:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 961 states have (on average 1.4068678459937565) internal successors, (1352), 963 states have internal predecessors, (1352), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 04:02:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1436 transitions. [2025-02-06 04:02:41,516 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1436 transitions. Word has length 143 [2025-02-06 04:02:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:41,517 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1436 transitions. [2025-02-06 04:02:41,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 04:02:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1436 transitions. [2025-02-06 04:02:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 04:02:41,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:41,518 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:41,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 04:02:41,519 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:41,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1592933890, now seen corresponding path program 1 times [2025-02-06 04:02:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:02:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453370073] [2025-02-06 04:02:41,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:41,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:02:41,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:02:41,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:02:41,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:41,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:02:41,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:02:41,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 04:02:41,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 04:02:41,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:41,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:02:41,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:02:41,784 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:02:41,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:02:41,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 04:02:41,790 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:02:41,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:02:41,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:02:41 BoogieIcfgContainer [2025-02-06 04:02:41,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:02:41,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:02:41,961 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:02:41,961 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:02:41,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:01:55" (3/4) ... [2025-02-06 04:02:41,964 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:02:41,965 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:02:41,965 INFO L158 Benchmark]: Toolchain (without parser) took 47819.85ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 105.1MB in the beginning and 524.3MB in the end (delta: -419.2MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2025-02-06 04:02:41,965 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:41,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.01ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 89.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:02:41,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.59ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:02:41,966 INFO L158 Benchmark]: Boogie Preprocessor took 48.01ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 82.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:02:41,966 INFO L158 Benchmark]: IcfgBuilder took 814.09ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 42.8MB in the end (delta: 40.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:02:41,966 INFO L158 Benchmark]: TraceAbstraction took 46590.87ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 42.8MB in the beginning and 524.5MB in the end (delta: -481.7MB). Peak memory consumption was 315.2MB. Max. memory is 16.1GB. [2025-02-06 04:02:41,967 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 620.8MB. Free memory was 524.5MB in the beginning and 524.3MB in the end (delta: 198.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:02:41,967 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.01ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 89.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.59ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 85.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.01ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 82.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 814.09ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 42.8MB in the end (delta: 40.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 46590.87ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 42.8MB in the beginning and 524.5MB in the end (delta: -481.7MB). Peak memory consumption was 315.2MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 620.8MB. Free memory was 524.5MB in the beginning and 524.3MB in the end (delta: 198.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 119. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L55] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] signed long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] signed long int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L68] double* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L69] unsigned char last_1_WrapperStruct00_var_1_11 = 1; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=0, last_1_WrapperStruct00_var_1_11=1] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_11 [L128] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L100] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L110] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L115] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L116] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L118] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L120] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L121] EXPR WrapperStruct00.var_1_14 [L121] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_14 [L121] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L122] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L123] EXPR WrapperStruct00.var_1_15 [L123] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L123] EXPR WrapperStruct00.var_1_15 [L123] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L139] RET updateVariables() [L140] CALL step() [L73] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L74] COND FALSE !(! last_1_WrapperStruct00_var_1_11) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L79] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L79] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_7_Pointer)); [L80] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L80] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_10_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6, stepLocal_2=9] [L81] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_2) [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6] [L88] COND FALSE !(! (*(WrapperStruct00_var_1_11_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6] [L91] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L91] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6] [L91] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L91] (*(WrapperStruct00_var_1_6_Pointer)) = (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6] [L93] COND FALSE !((*(WrapperStruct00_var_1_4_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L131] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) [L131] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L131] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L131] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L131] EXPR (! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1) [L131] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) [L131] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer)))) [L131] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L131] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131-L132] return ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.4s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8260 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8254 mSDsluCounter, 19517 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15195 mSDsCounter, 810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8088 IncrementalHoareTripleChecker+Invalid, 8898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 810 mSolverCounterUnsat, 4322 mSDtfsCounter, 8088 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1225 GetRequests, 970 SyntacticMatches, 9 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1082occurred in iteration=17, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 1823 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 3725 NumberOfCodeBlocks, 3725 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3556 ConstructedInterpolants, 0 QuantifiedInterpolants, 38611 SizeOfPredicates, 20 NumberOfNonLiveVariables, 3260 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 12150/12480 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 04:02:41,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:02:44,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:02:44,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 04:02:44,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:02:44,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:02:44,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:02:44,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:02:44,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:02:44,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:02:44,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:02:44,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:02:44,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:02:44,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:02:44,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:02:44,347 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:02:44,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:02:44,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:02:44,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:02:44,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:02:44,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:02:44,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:02:44,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:02:44,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:02:44,349 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:02:44,349 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:02:44,349 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:02:44,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:02:44,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:02:44,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:02:44,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:02:44,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:02:44,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:02:44,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:02:44,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:02:44,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:02:44,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:02:44,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:02:44,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:02:44,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:02:44,351 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:02:44,351 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:02:44,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:02:44,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:02:44,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:02:44,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:02:44,352 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2025-02-06 04:02:44,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:02:44,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:02:44,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:02:44,649 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:02:44,649 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:02:44,650 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-sp_file-3.i [2025-02-06 04:02:46,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094b87285/cd59306d0d4145ebacf24454a3619a42/FLAGb3b69fca5 [2025-02-06 04:02:46,273 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:02:46,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2025-02-06 04:02:46,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094b87285/cd59306d0d4145ebacf24454a3619a42/FLAGb3b69fca5 [2025-02-06 04:02:46,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094b87285/cd59306d0d4145ebacf24454a3619a42 [2025-02-06 04:02:46,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:02:46,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:02:46,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:02:46,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:02:46,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:02:46,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c46db7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46, skipping insertion in model container [2025-02-06 04:02:46,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:02:46,480 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-sp_file-3.i[916,929] [2025-02-06 04:02:46,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:02:46,598 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:02:46,610 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-sp_file-3.i[916,929] [2025-02-06 04:02:46,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:02:46,698 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:02:46,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46 WrapperNode [2025-02-06 04:02:46,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:02:46,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:02:46,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:02:46,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:02:46,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,781 INFO L138 Inliner]: procedures = 34, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 633 [2025-02-06 04:02:46,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:02:46,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:02:46,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:02:46,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:02:46,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,848 INFO L175 MemorySlicer]: Split 152 memory accesses to 2 slices as follows [2, 150]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2025-02-06 04:02:46,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:02:46,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:02:46,904 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:02:46,904 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:02:46,905 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (1/1) ... [2025-02-06 04:02:46,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:02:46,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:02:46,937 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 04:02:46,939 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 04:02:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:02:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 04:02:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 04:02:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 04:02:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 04:02:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 04:02:46,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 04:02:46,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 04:02:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 04:02:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:02:46,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:02:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:02:46,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:02:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:02:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:02:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:02:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:02:47,099 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:02:47,100 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:02:49,119 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~ite115#1;havoc property_#t~ite114#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short112#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~ite123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite140#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~ite179#1;havoc property_#t~mem176#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite151#1;havoc property_#t~mem150#1;havoc property_#t~ite158#1;havoc property_#t~mem152#1;havoc property_#t~ite154#1;havoc property_#t~mem153#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~ite175#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite163#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite167#1;havoc property_#t~mem166#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~ite170#1;havoc property_#t~mem169#1;havoc property_#t~mem171#1;havoc property_#t~ite173#1;havoc property_#t~mem172#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~short180#1; [2025-02-06 04:02:49,164 INFO L? ?]: Removed 192 outVars from TransFormulas that were not future-live. [2025-02-06 04:02:49,164 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:02:49,179 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:02:49,179 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:02:49,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:02:49 BoogieIcfgContainer [2025-02-06 04:02:49,179 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:02:49,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:02:49,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:02:49,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:02:49,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:02:46" (1/3) ... [2025-02-06 04:02:49,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104540ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:02:49, skipping insertion in model container [2025-02-06 04:02:49,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:02:46" (2/3) ... [2025-02-06 04:02:49,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104540ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:02:49, skipping insertion in model container [2025-02-06 04:02:49,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:02:49" (3/3) ... [2025-02-06 04:02:49,189 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2025-02-06 04:02:49,202 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:02:49,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-3.i that has 2 procedures, 148 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:02:49,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:02:49,262 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;@58daa97a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:02:49,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:02:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 130 states have internal predecessors, (188), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:02:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 04:02:49,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:49,278 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:49,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:49,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash -55988482, now seen corresponding path program 1 times [2025-02-06 04:02:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:02:49,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037040713] [2025-02-06 04:02:49,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:49,292 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 04:02:49,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:02:49,294 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 04:02:49,295 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 04:02:49,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 04:02:49,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 04:02:49,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:49,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:49,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:02:49,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-02-06 04:02:49,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:49,723 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:02:49,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037040713] [2025-02-06 04:02:49,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037040713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:49,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:49,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:02:49,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347165410] [2025-02-06 04:02:49,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:02:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:02:49,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:02:49,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:02:49,748 INFO L87 Difference]: Start difference. First operand has 148 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 130 states have internal predecessors, (188), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:49,779 INFO L93 Difference]: Finished difference Result 290 states and 451 transitions. [2025-02-06 04:02:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:02:49,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-02-06 04:02:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:49,786 INFO L225 Difference]: With dead ends: 290 [2025-02-06 04:02:49,786 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 04:02:49,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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 04:02:49,790 INFO L435 NwaCegarLoop]: 215 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, 215 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 04:02:49,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:02:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 04:02:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-06 04:02:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:02:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-02-06 04:02:49,835 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2025-02-06 04:02:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:49,835 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-02-06 04:02:49,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:02:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-02-06 04:02:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 04:02:49,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:49,841 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:49,849 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 04:02:50,041 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 04:02:50,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:50,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:50,043 INFO L85 PathProgramCache]: Analyzing trace with hash -918569294, now seen corresponding path program 1 times [2025-02-06 04:02:50,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:02:50,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517303594] [2025-02-06 04:02:50,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:50,043 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 04:02:50,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:02:50,046 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 04:02:50,048 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 04:02:50,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 04:02:50,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 04:02:50,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:50,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:50,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:02:50,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:50,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:50,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:02:50,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517303594] [2025-02-06 04:02:50,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517303594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:50,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:50,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:02:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638152392] [2025-02-06 04:02:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:50,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:02:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:02:50,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:02:50,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:02:50,430 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:02:50,476 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2025-02-06 04:02:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:02:50,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-02-06 04:02:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:02:50,480 INFO L225 Difference]: With dead ends: 289 [2025-02-06 04:02:50,480 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 04:02:50,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 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 04:02:50,484 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:02:50,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:02:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 04:02:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-06 04:02:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:02:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2025-02-06 04:02:50,502 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2025-02-06 04:02:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:02:50,505 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2025-02-06 04:02:50,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:02:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2025-02-06 04:02:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 04:02:50,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:02:50,508 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:02:50,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:02:50,708 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 04:02:50,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:02:50,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:02:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1922887888, now seen corresponding path program 1 times [2025-02-06 04:02:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:02:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690159166] [2025-02-06 04:02:50,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:02:50,710 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 04:02:50,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:02:50,712 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 04:02:50,713 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 04:02:50,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 04:02:51,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 04:02:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:02:51,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:02:51,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 04:02:51,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:02:54,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-02-06 04:02:54,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2025-02-06 04:02:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:02:57,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:02:57,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:02:57,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690159166] [2025-02-06 04:02:57,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690159166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:02:57,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:02:57,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:02:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48720605] [2025-02-06 04:02:57,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:02:57,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:02:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:02:57,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:02:57,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2025-02-06 04:02:57,185 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)