./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.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-68.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 b4559e8b226a38c0de79abf5c99da960f61fddc84376577123ac96424c5c8f2a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:07:03,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:07:03,331 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:07:03,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:07:03,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:07:03,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:07:03,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:07:03,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:07:03,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:07:03,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:07:03,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:07:03,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:07:03,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:07:03,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:07:03,359 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:07:03,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:07:03,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:07:03,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:07:03,361 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:07:03,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:07:03,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:07:03,362 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:07:03,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:07:03,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:07:03,362 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 -> b4559e8b226a38c0de79abf5c99da960f61fddc84376577123ac96424c5c8f2a [2025-02-06 04:07:03,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:07:03,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:07:03,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:07:03,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:07:03,580 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:07:03,581 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-68.i [2025-02-06 04:07:04,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86237fd0c/e6f11dea5c1d4aeea10afe9cb36f75e7/FLAGa6009b3c8 [2025-02-06 04:07:04,969 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:07:04,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i [2025-02-06 04:07:04,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86237fd0c/e6f11dea5c1d4aeea10afe9cb36f75e7/FLAGa6009b3c8 [2025-02-06 04:07:05,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86237fd0c/e6f11dea5c1d4aeea10afe9cb36f75e7 [2025-02-06 04:07:05,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:07:05,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:07:05,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:07:05,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:07:05,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:07:05,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e86e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05, skipping insertion in model container [2025-02-06 04:07:05,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:07:05,378 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-68.i[917,930] [2025-02-06 04:07:05,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:07:05,427 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:07:05,434 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-68.i[917,930] [2025-02-06 04:07:05,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:07:05,466 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:07:05,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05 WrapperNode [2025-02-06 04:07:05,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:07:05,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:07:05,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:07:05,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:07:05,472 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:07:05" (1/1) ... [2025-02-06 04:07:05,480 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:07:05" (1/1) ... [2025-02-06 04:07:05,503 INFO L138 Inliner]: procedures = 30, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2025-02-06 04:07:05,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:07:05,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:07:05,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:07:05,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:07:05,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,521 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:07:05,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:07:05,538 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:07:05,538 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:07:05,538 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:07:05,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (1/1) ... [2025-02-06 04:07:05,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:07:05,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:05,570 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:07:05,573 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:07:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:07:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:07:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:07:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:07:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:07:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:07:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:07:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:07:05,590 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:07:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:07:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:07:05,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:07:05,693 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:07:05,694 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:07:06,076 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite111#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite130#1;havoc property_#t~mem120#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-02-06 04:07:06,119 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-02-06 04:07:06,119 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:07:06,130 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:07:06,131 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:07:06,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:06 BoogieIcfgContainer [2025-02-06 04:07:06,131 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:07:06,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:07:06,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:07:06,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:07:06,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:07:05" (1/3) ... [2025-02-06 04:07:06,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725e591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:07:06, skipping insertion in model container [2025-02-06 04:07:06,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:05" (2/3) ... [2025-02-06 04:07:06,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725e591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:07:06, skipping insertion in model container [2025-02-06 04:07:06,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:06" (3/3) ... [2025-02-06 04:07:06,138 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-68.i [2025-02-06 04:07:06,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:07:06,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-68.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:07:06,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:07:06,207 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;@4bad0acc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:07:06,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:07:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:06,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:06,219 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:06,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:06,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 813634942, now seen corresponding path program 1 times [2025-02-06 04:07:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:06,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124258064] [2025-02-06 04:07:06,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:06,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:06,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:06,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:06,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 04:07:06,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:06,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124258064] [2025-02-06 04:07:06,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124258064] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:06,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301881374] [2025-02-06 04:07:06,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:06,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:06,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:06,541 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:07:06,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:07:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:06,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:06,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:06,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:06,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:07:06,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-06 04:07:06,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301881374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:07:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506558170] [2025-02-06 04:07:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:06,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:07:06,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:06,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:07:06,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:07:06,829 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:06,853 INFO L93 Difference]: Finished difference Result 220 states and 342 transitions. [2025-02-06 04:07:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:07:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-02-06 04:07:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:06,859 INFO L225 Difference]: With dead ends: 220 [2025-02-06 04:07:06,859 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 04:07:06,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 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:07:06,863 INFO L435 NwaCegarLoop]: 160 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, 160 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:07:06,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 04:07:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 04:07:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-02-06 04:07:06,906 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2025-02-06 04:07:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:06,907 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-02-06 04:07:06,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-02-06 04:07:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:06,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:06,912 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:06,923 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:07:07,113 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:07:07,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:07,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:07,114 INFO L85 PathProgramCache]: Analyzing trace with hash -911656629, now seen corresponding path program 1 times [2025-02-06 04:07:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:07,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148888083] [2025-02-06 04:07:07,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:07,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:07,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:07,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:07,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:07,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:07:07,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148888083] [2025-02-06 04:07:07,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148888083] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701386432] [2025-02-06 04:07:07,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:07,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:07,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:07,602 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:07:07,606 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:07:07,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:07,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:07,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:07,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:07:07,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:07,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:07,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701386432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:07,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:07,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 04:07:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785386260] [2025-02-06 04:07:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:07,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:07:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:07,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:07:07,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:07,882 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:07,913 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2025-02-06 04:07:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:07:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 04:07:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:07,918 INFO L225 Difference]: With dead ends: 220 [2025-02-06 04:07:07,918 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 04:07:07,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:07,919 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:07,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 04:07:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-02-06 04:07:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2025-02-06 04:07:07,932 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 146 [2025-02-06 04:07:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:07,933 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2025-02-06 04:07:07,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2025-02-06 04:07:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:07,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:07,936 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:07,943 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:07:08,140 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:07:08,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:08,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1586359308, now seen corresponding path program 1 times [2025-02-06 04:07:08,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:08,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567507573] [2025-02-06 04:07:08,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:08,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:08,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:08,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:08,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:07:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567507573] [2025-02-06 04:07:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567507573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:08,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551946475] [2025-02-06 04:07:08,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:08,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:08,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:08,463 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:07:08,466 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:07:08,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:08,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:08,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:08,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:08,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:07:08,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:08,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551946475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:08,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 04:07:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134185818] [2025-02-06 04:07:08,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:08,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:07:08,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:08,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:07:08,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:08,731 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:08,762 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2025-02-06 04:07:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:07:08,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 04:07:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:08,764 INFO L225 Difference]: With dead ends: 224 [2025-02-06 04:07:08,764 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 04:07:08,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:08,765 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:08,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 04:07:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-02-06 04:07:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-02-06 04:07:08,772 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 146 [2025-02-06 04:07:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:08,772 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-02-06 04:07:08,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-02-06 04:07:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:08,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:08,774 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:08,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 04:07:08,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:08,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:08,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -221095155, now seen corresponding path program 1 times [2025-02-06 04:07:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:08,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618983169] [2025-02-06 04:07:08,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:09,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:09,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:09,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:09,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:07:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:09,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618983169] [2025-02-06 04:07:09,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618983169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:09,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607318882] [2025-02-06 04:07:09,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:09,369 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:07:09,376 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:07:09,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:09,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:09,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:09,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:09,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:07:09,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:09,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607318882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:09,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:09,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 04:07:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815562747] [2025-02-06 04:07:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:09,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:07:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:09,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:07:09,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:09,601 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:09,618 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2025-02-06 04:07:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:07:09,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 04:07:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:09,620 INFO L225 Difference]: With dead ends: 228 [2025-02-06 04:07:09,620 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 04:07:09,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:09,621 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:09,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 04:07:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-02-06 04:07:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-02-06 04:07:09,627 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 146 [2025-02-06 04:07:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:09,627 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-02-06 04:07:09,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-02-06 04:07:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:09,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:09,629 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:09,639 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:07:09,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:09,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:09,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:09,830 INFO L85 PathProgramCache]: Analyzing trace with hash 666408526, now seen corresponding path program 1 times [2025-02-06 04:07:09,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:09,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322203828] [2025-02-06 04:07:09,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:09,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:09,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:09,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:09,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:09,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:07:09,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322203828] [2025-02-06 04:07:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322203828] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349704842] [2025-02-06 04:07:09,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:09,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:09,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:10,003 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:07:10,007 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:07:10,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:10,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:10,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:10,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:10,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:07:10,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:10,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349704842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:10,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 04:07:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507707051] [2025-02-06 04:07:10,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:10,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:07:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:10,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:07:10,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:10,229 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:10,244 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-02-06 04:07:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:07:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 04:07:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:10,246 INFO L225 Difference]: With dead ends: 232 [2025-02-06 04:07:10,246 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 04:07:10,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:10,247 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:10,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 04:07:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-02-06 04:07:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-02-06 04:07:10,252 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 146 [2025-02-06 04:07:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:10,252 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-02-06 04:07:10,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-02-06 04:07:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:10,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:10,253 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:10,262 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:07:10,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:10,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:10,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash 667332047, now seen corresponding path program 1 times [2025-02-06 04:07:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:10,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669467679] [2025-02-06 04:07:10,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:10,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:10,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:10,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:10,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:07:10,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:10,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669467679] [2025-02-06 04:07:10,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669467679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600554176] [2025-02-06 04:07:10,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:10,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:10,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:10,698 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:07:10,699 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:07:10,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:10,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:10,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:10,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:10,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:07:10,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:10,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600554176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 04:07:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831830229] [2025-02-06 04:07:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:10,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:10,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:10,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:10,953 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:10,982 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-02-06 04:07:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 04:07:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:10,984 INFO L225 Difference]: With dead ends: 236 [2025-02-06 04:07:10,985 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 04:07:10,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 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:07:10,986 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:10,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 04:07:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-02-06 04:07:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2025-02-06 04:07:10,997 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 146 [2025-02-06 04:07:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:10,999 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2025-02-06 04:07:10,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2025-02-06 04:07:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:11,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:11,005 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:11,012 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:07:11,205 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,SelfDestructingSolverStorable5 [2025-02-06 04:07:11,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:11,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash -209993560, now seen corresponding path program 1 times [2025-02-06 04:07:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766061605] [2025-02-06 04:07:11,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:11,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:11,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:11,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:11,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:07:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766061605] [2025-02-06 04:07:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766061605] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853239067] [2025-02-06 04:07:11,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:11,413 INFO L229 MonitoredProcess]: Starting monitored process 8 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:07:11,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 04:07:11,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:11,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:11,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:11,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:11,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:07:11,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:11,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853239067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:11,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:11,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 04:07:11,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692458865] [2025-02-06 04:07:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:11,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:11,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:11,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:11,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:11,666 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:11,706 INFO L93 Difference]: Finished difference Result 242 states and 343 transitions. [2025-02-06 04:07:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:11,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 04:07:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:11,708 INFO L225 Difference]: With dead ends: 242 [2025-02-06 04:07:11,708 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 04:07:11,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 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:07:11,709 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:11,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 04:07:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2025-02-06 04:07:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-02-06 04:07:11,714 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 146 [2025-02-06 04:07:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:11,714 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-02-06 04:07:11,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-02-06 04:07:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:11,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:11,715 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:11,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 04:07:11,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:11,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:11,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -960472911, now seen corresponding path program 1 times [2025-02-06 04:07:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627031054] [2025-02-06 04:07:11,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:11,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:11,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:11,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:11,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627031054] [2025-02-06 04:07:12,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627031054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:12,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:12,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786565367] [2025-02-06 04:07:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:12,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:12,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:12,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:12,339 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:12,434 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2025-02-06 04:07:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:07:12,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2025-02-06 04:07:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:12,435 INFO L225 Difference]: With dead ends: 241 [2025-02-06 04:07:12,435 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 04:07:12,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:07:12,436 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 111 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:12,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 222 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:07:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 04:07:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-02-06 04:07:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2025-02-06 04:07:12,451 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 148 [2025-02-06 04:07:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:12,451 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2025-02-06 04:07:12,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2025-02-06 04:07:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:12,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:12,452 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:12,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:07:12,453 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:12,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash -929453104, now seen corresponding path program 1 times [2025-02-06 04:07:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510273716] [2025-02-06 04:07:12,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:12,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:12,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:12,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:12,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:12,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:12,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510273716] [2025-02-06 04:07:12,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510273716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:12,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:12,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:12,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479654982] [2025-02-06 04:07:12,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:12,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:12,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:12,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:12,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:12,866 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:13,102 INFO L93 Difference]: Finished difference Result 286 states and 397 transitions. [2025-02-06 04:07:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 04:07:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:13,103 INFO L225 Difference]: With dead ends: 286 [2025-02-06 04:07:13,103 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 04:07:13,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:13,104 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 46 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:13,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 484 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:07:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 04:07:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 125. [2025-02-06 04:07:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.330188679245283) internal successors, (141), 106 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2025-02-06 04:07:13,123 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 148 [2025-02-06 04:07:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:13,123 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2025-02-06 04:07:13,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2025-02-06 04:07:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:13,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:13,124 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:13,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:07:13,124 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:13,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash 393084684, now seen corresponding path program 1 times [2025-02-06 04:07:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:13,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612828440] [2025-02-06 04:07:13,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:13,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:13,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:13,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:13,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:13,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:13,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612828440] [2025-02-06 04:07:13,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612828440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:13,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:13,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107026729] [2025-02-06 04:07:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:13,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:13,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:13,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:13,408 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:13,923 INFO L93 Difference]: Finished difference Result 295 states and 409 transitions. [2025-02-06 04:07:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:13,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 04:07:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:13,925 INFO L225 Difference]: With dead ends: 295 [2025-02-06 04:07:13,927 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 04:07:13,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:07:13,927 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 51 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:13,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 462 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:07:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 04:07:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2025-02-06 04:07:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 123 states have internal predecessors, (164), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2025-02-06 04:07:13,933 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 148 [2025-02-06 04:07:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:13,934 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2025-02-06 04:07:13,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2025-02-06 04:07:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:13,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:13,935 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:13,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:07:13,935 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:13,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -117449493, now seen corresponding path program 1 times [2025-02-06 04:07:13,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:13,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789917501] [2025-02-06 04:07:13,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:13,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:13,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:13,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:13,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 04:07:14,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:14,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789917501] [2025-02-06 04:07:14,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789917501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:14,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044820508] [2025-02-06 04:07:14,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:14,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:14,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:14,131 INFO L229 MonitoredProcess]: Starting monitored process 9 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:07:14,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 04:07:14,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:14,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:14,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:14,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:14,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:07:14,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:14,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:14,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044820508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:14,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:14,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 04:07:14,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25465378] [2025-02-06 04:07:14,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:14,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:14,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:14,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:14,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:14,399 INFO L87 Difference]: Start difference. First operand 142 states and 198 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:14,422 INFO L93 Difference]: Finished difference Result 284 states and 397 transitions. [2025-02-06 04:07:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:14,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 04:07:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:14,423 INFO L225 Difference]: With dead ends: 284 [2025-02-06 04:07:14,423 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 04:07:14,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 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:07:14,424 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:14,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 04:07:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-06 04:07:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.3253968253968254) internal successors, (167), 126 states have internal predecessors, (167), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2025-02-06 04:07:14,431 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 148 [2025-02-06 04:07:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:14,431 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2025-02-06 04:07:14,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2025-02-06 04:07:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:14,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:14,432 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:14,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 04:07:14,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:14,633 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash -424465527, now seen corresponding path program 1 times [2025-02-06 04:07:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030001884] [2025-02-06 04:07:14,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:14,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:14,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:14,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:14,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:07:14,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453219188] [2025-02-06 04:07:14,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:14,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:14,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:14,791 INFO L229 MonitoredProcess]: Starting monitored process 10 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:07:14,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 04:07:14,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:16,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:16,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:16,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:07:16,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:07:16,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:18,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:18,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:18,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:07:18,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:07:18,303 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:07:18,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:07:18,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 04:07:18,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:18,510 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:07:18,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:07:18,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:07:18 BoogieIcfgContainer [2025-02-06 04:07:18,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:07:18,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:07:18,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:07:18,688 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:07:18,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:06" (3/4) ... [2025-02-06 04:07:18,690 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:07:18,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:07:18,691 INFO L158 Benchmark]: Toolchain (without parser) took 13414.39ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 110.0MB in the beginning and 377.5MB in the end (delta: -267.5MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-02-06 04:07:18,691 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:07:18,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.24ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 93.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:07:18,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.83ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:07:18,693 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:07:18,693 INFO L158 Benchmark]: IcfgBuilder took 593.65ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 50.8MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:07:18,693 INFO L158 Benchmark]: TraceAbstraction took 12553.97ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 50.8MB in the beginning and 377.6MB in the end (delta: -326.8MB). Peak memory consumption was 203.2MB. Max. memory is 16.1GB. [2025-02-06 04:07:18,693 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 427.8MB. Free memory was 377.6MB in the beginning and 377.5MB in the end (delta: 129.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:07:18,694 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.18ms. Allocated memory is still 226.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.24ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 93.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.83ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 87.2MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 593.65ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 50.8MB in the end (delta: 36.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12553.97ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 50.8MB in the beginning and 377.6MB in the end (delta: -326.8MB). Peak memory consumption was 203.2MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 427.8MB. Free memory was 377.6MB in the beginning and 377.5MB in the end (delta: 129.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L61] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L62] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L63] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L64] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L65] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L66] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L67] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L68] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L69] signed short int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L70] signed short int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L71] signed short int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L72] signed short int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L73] signed long int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L74] unsigned long int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L75] unsigned long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L76] float* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L77] signed long int* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L78] signed short int last_1_WrapperStruct00_var_1_13 = -25; [L79] signed long int last_1_WrapperStruct00_var_1_17 = 5; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=0, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L150] isInitial = 1 [L151] FCALL initially() [L152] COND TRUE 1 [L153] CALL updateLastVariables() [L142] EXPR WrapperStruct00.var_1_13 [L142] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L143] EXPR WrapperStruct00.var_1_17 [L143] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L153] RET updateLastVariables() [L154] CALL updateVariables() [L113] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L114] EXPR WrapperStruct00.var_1_2 [L114] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_2 [L114] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L116] EXPR WrapperStruct00.var_1_3 [L116] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_3 [L116] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L117] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L118] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L123] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L124] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L125] EXPR WrapperStruct00.var_1_11 [L125] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_11 [L125] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L125] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L126] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L127] EXPR WrapperStruct00.var_1_12 [L127] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L127] EXPR WrapperStruct00.var_1_12 [L127] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L127] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L127] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L127] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L128] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L129] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L130] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L131] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L132] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L134] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L135] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L136] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L137] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ulong() [L138] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L138] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L138] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L139] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L139] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L139] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L154] RET updateVariables() [L155] CALL step() [L83] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L83] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17; [L84] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_2=49] [L84] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L91] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L93] (*(WrapperStruct00_var_1_17_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L94] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L95] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L95] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L96] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L96] (*(WrapperStruct00_var_1_21_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L97] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L97] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_17_Pointer)); [L98] EXPR \read(*WrapperStruct00_var_1_21_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_1=-10, stepLocal_2=49] [L98] COND FALSE !(stepLocal_1 != (*(WrapperStruct00_var_1_21_Pointer))) [L101] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L101] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L101] unsigned long int stepLocal_0 = (*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer)); [L102] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L102] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=-4294967298, stepLocal_2=49] [L102] COND FALSE !(((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L107] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=-4294967298, stepLocal_2=49] [L107] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L155] RET step() [L156] CALL, EXPR property() [L146] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) [L146] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1 [L146] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L146] EXPR \read(*WrapperStruct00_var_1_21_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) [L146] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L146] EXPR (((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146] EXPR (((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L146-L147] return (((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_18_Pointer)) + (*(WrapperStruct00_var_1_21_Pointer))) >= ((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_21_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((((*(WrapperStruct00_var_1_21_Pointer))) > ((*(WrapperStruct00_var_1_18_Pointer)))) ? ((*(WrapperStruct00_var_1_21_Pointer))) : ((*(WrapperStruct00_var_1_18_Pointer))))))) : 1)) && (((*(WrapperStruct00_var_1_17_Pointer)) != (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) ((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((last_1_WrapperStruct00_var_1_13 <= ((*(WrapperStruct00_var_1_8_Pointer)) + last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_17_Pointer)))) ; [L156] RET, EXPR property() [L156] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:17}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:33}, WrapperStruct00_var_1_13_Pointer={4:41}, WrapperStruct00_var_1_14_Pointer={4:43}, WrapperStruct00_var_1_15_Pointer={4:45}, WrapperStruct00_var_1_16_Pointer={4:47}, WrapperStruct00_var_1_17_Pointer={4:49}, WrapperStruct00_var_1_18_Pointer={4:53}, WrapperStruct00_var_1_19_Pointer={4:57}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:61}, WrapperStruct00_var_1_21_Pointer={4:65}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 12, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 5011 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3370 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 558 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1641 mSDtfsCounter, 558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1239 GetRequests, 1178 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=11, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3080 NumberOfCodeBlocks, 3080 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 3671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5029 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 10073/10336 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:07:18,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.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 b4559e8b226a38c0de79abf5c99da960f61fddc84376577123ac96424c5c8f2a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:07:20,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:07:20,820 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:07:20,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:07:20,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:07:20,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:07:20,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:07:20,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:07:20,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:07:20,865 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:07:20,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:07:20,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:07:20,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:07:20,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:07:20,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:07:20,866 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:07:20,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:07:20,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:07:20,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:07:20,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:07:20,868 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 -> b4559e8b226a38c0de79abf5c99da960f61fddc84376577123ac96424c5c8f2a [2025-02-06 04:07:21,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:07:21,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:07:21,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:07:21,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:07:21,108 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:07:21,109 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-68.i [2025-02-06 04:07:22,244 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a45a47bb5/eb540fb7a0f14cb8ab880e200c9458dd/FLAGca6bc0e07 [2025-02-06 04:07:22,510 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:07:22,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-68.i [2025-02-06 04:07:22,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a45a47bb5/eb540fb7a0f14cb8ab880e200c9458dd/FLAGca6bc0e07 [2025-02-06 04:07:22,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a45a47bb5/eb540fb7a0f14cb8ab880e200c9458dd [2025-02-06 04:07:22,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:07:22,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:07:22,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:07:22,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:07:22,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:07:22,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:07:22" (1/1) ... [2025-02-06 04:07:22,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301982dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:22, skipping insertion in model container [2025-02-06 04:07:22,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:07:22" (1/1) ... [2025-02-06 04:07:22,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:07:22,950 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-68.i[917,930] [2025-02-06 04:07:23,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:07:23,030 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:07:23,039 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-68.i[917,930] [2025-02-06 04:07:23,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:07:23,110 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:07:23,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23 WrapperNode [2025-02-06 04:07:23,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:07:23,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:07:23,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:07:23,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:07:23,117 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:07:23" (1/1) ... [2025-02-06 04:07:23,133 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:07:23" (1/1) ... [2025-02-06 04:07:23,165 INFO L138 Inliner]: procedures = 40, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-02-06 04:07:23,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:07:23,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:07:23,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:07:23,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:07:23,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,204 INFO L175 MemorySlicer]: Split 143 memory accesses to 2 slices as follows [2, 141]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2025-02-06 04:07:23,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:07:23,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:07:23,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:07:23,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:07:23,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (1/1) ... [2025-02-06 04:07:23,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:07:23,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:23,248 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:07:23,256 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:07:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:07:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 04:07:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 04:07:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 04:07:23,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:07:23,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 04:07:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 04:07:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 04:07:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 04:07:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 04:07:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 04:07:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 04:07:23,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 04:07:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 04:07:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 04:07:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:07:23,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:07:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 04:07:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 04:07:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:07:23,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:07:23,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:07:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:07:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 04:07:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 04:07:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:07:23,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:07:23,410 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:07:23,411 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:07:27,402 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite111#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite130#1;havoc property_#t~mem120#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-02-06 04:07:27,430 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-02-06 04:07:27,430 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:07:27,437 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:07:27,437 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:07:27,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:27 BoogieIcfgContainer [2025-02-06 04:07:27,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:07:27,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:07:27,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:07:27,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:07:27,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:07:22" (1/3) ... [2025-02-06 04:07:27,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b96a7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:07:27, skipping insertion in model container [2025-02-06 04:07:27,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:23" (2/3) ... [2025-02-06 04:07:27,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b96a7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:07:27, skipping insertion in model container [2025-02-06 04:07:27,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:27" (3/3) ... [2025-02-06 04:07:27,443 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-68.i [2025-02-06 04:07:27,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:07:27,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-68.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:07:27,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:07:27,526 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;@1e9a1d0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:07:27,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:07:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:27,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:27,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:27,542 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:27,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:27,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1440182119, now seen corresponding path program 1 times [2025-02-06 04:07:27,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:27,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787709190] [2025-02-06 04:07:27,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:27,558 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:07:27,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:27,560 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:07:27,562 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:07:27,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:28,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:28,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:28,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:28,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:07:28,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-06 04:07:28,117 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:28,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787709190] [2025-02-06 04:07:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787709190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:07:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580026476] [2025-02-06 04:07:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:28,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:07:28,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:28,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:07:28,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:07:28,135 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:28,152 INFO L93 Difference]: Finished difference Result 220 states and 342 transitions. [2025-02-06 04:07:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:07:28,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-02-06 04:07:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:28,158 INFO L225 Difference]: With dead ends: 220 [2025-02-06 04:07:28,158 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 04:07:28,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:07:28,161 INFO L435 NwaCegarLoop]: 160 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, 160 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:07:28,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 04:07:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 04:07:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-02-06 04:07:28,187 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2025-02-06 04:07:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:28,188 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-02-06 04:07:28,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-02-06 04:07:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:28,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:28,189 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:28,206 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:07:28,394 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:07:28,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:28,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:28,395 INFO L85 PathProgramCache]: Analyzing trace with hash -285109452, now seen corresponding path program 1 times [2025-02-06 04:07:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422306418] [2025-02-06 04:07:28,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:28,396 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:07:28,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:28,398 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:07:28,401 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:07:28,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:28,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:28,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:28,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:28,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:07:28,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:29,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:29,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422306418] [2025-02-06 04:07:29,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422306418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:29,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:29,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089939413] [2025-02-06 04:07:29,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:29,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:29,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:29,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:29,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:29,067 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:29,118 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2025-02-06 04:07:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:29,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 04:07:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:29,120 INFO L225 Difference]: With dead ends: 220 [2025-02-06 04:07:29,120 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 04:07:29,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:29,122 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:29,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 04:07:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-06 04:07:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2025-02-06 04:07:29,129 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 146 [2025-02-06 04:07:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:29,130 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2025-02-06 04:07:29,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2025-02-06 04:07:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 04:07:29,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:29,132 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:29,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 04:07:29,336 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:07:29,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:29,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash 592216155, now seen corresponding path program 1 times [2025-02-06 04:07:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:29,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364902642] [2025-02-06 04:07:29,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:29,338 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:07:29,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:29,340 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:07:29,346 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:07:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 04:07:29,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 04:07:29,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:29,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:29,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:07:29,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:29,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:29,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364902642] [2025-02-06 04:07:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364902642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297609171] [2025-02-06 04:07:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:29,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:29,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:29,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:29,822 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:29,859 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2025-02-06 04:07:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:29,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-02-06 04:07:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:29,861 INFO L225 Difference]: With dead ends: 226 [2025-02-06 04:07:29,861 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 04:07:29,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:29,862 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:29,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 04:07:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2025-02-06 04:07:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-02-06 04:07:29,868 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 146 [2025-02-06 04:07:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:29,868 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-02-06 04:07:29,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-02-06 04:07:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:29,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:29,870 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:29,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 04:07:30,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:30,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:30,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash 78260086, now seen corresponding path program 1 times [2025-02-06 04:07:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:30,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059339199] [2025-02-06 04:07:30,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:30,075 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:07:30,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:30,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:30,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 04:07:30,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:30,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:30,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:30,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:30,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:07:30,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:30,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:30,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:30,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059339199] [2025-02-06 04:07:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059339199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:30,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079760901] [2025-02-06 04:07:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:30,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:07:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:30,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:07:30,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:30,560 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:30,601 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2025-02-06 04:07:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:07:30,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 04:07:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:30,602 INFO L225 Difference]: With dead ends: 230 [2025-02-06 04:07:30,602 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 04:07:30,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:07:30,603 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:30,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 604 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 04:07:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-02-06 04:07:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-02-06 04:07:30,609 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 148 [2025-02-06 04:07:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:30,610 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-02-06 04:07:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-02-06 04:07:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:30,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:30,611 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:30,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 04:07:30,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:30,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:30,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1718691273, now seen corresponding path program 1 times [2025-02-06 04:07:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:30,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163716227] [2025-02-06 04:07:30,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:30,816 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:07:30,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:30,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:30,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 04:07:30,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:31,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:31,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:31,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:31,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:07:31,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:31,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:31,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163716227] [2025-02-06 04:07:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163716227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:31,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:31,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:07:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087123805] [2025-02-06 04:07:31,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:31,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:07:31,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:31,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:07:31,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:31,350 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:31,397 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-02-06 04:07:31,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:07:31,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 04:07:31,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:31,398 INFO L225 Difference]: With dead ends: 236 [2025-02-06 04:07:31,398 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 04:07:31,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:31,399 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:31,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 745 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 04:07:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-02-06 04:07:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2025-02-06 04:07:31,405 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 148 [2025-02-06 04:07:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:31,405 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2025-02-06 04:07:31,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2025-02-06 04:07:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:31,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:31,407 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:31,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 04:07:31,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:31,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:31,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 768821560, now seen corresponding path program 1 times [2025-02-06 04:07:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:31,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131980105] [2025-02-06 04:07:31,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:31,608 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:07:31,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:31,610 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:31,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 04:07:31,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:32,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:32,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:32,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:32,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:07:32,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:32,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:32,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:32,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131980105] [2025-02-06 04:07:32,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131980105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:32,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:32,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:07:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868089417] [2025-02-06 04:07:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:32,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:07:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:32,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:07:32,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:07:32,113 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:32,339 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2025-02-06 04:07:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:32,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 04:07:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:32,341 INFO L225 Difference]: With dead ends: 240 [2025-02-06 04:07:32,341 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 04:07:32,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:07:32,343 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:32,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 882 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:07:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 04:07:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-02-06 04:07:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-02-06 04:07:32,352 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 148 [2025-02-06 04:07:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:32,353 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-02-06 04:07:32,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-02-06 04:07:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:32,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:32,354 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:32,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 04:07:32,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:32,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:32,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:32,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1656325241, now seen corresponding path program 1 times [2025-02-06 04:07:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:32,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445598428] [2025-02-06 04:07:32,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:32,556 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:07:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:32,560 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:32,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 04:07:32,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:32,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:32,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:32,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:32,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 04:07:32,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:33,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:33,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445598428] [2025-02-06 04:07:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445598428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:33,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:07:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584774940] [2025-02-06 04:07:33,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:33,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:07:33,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:33,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:07:33,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:33,014 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:33,160 INFO L93 Difference]: Finished difference Result 244 states and 345 transitions. [2025-02-06 04:07:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:07:33,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 04:07:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:33,162 INFO L225 Difference]: With dead ends: 244 [2025-02-06 04:07:33,162 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 04:07:33,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:07:33,163 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:33,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1021 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:07:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 04:07:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-02-06 04:07:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2025-02-06 04:07:33,168 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 148 [2025-02-06 04:07:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:33,168 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2025-02-06 04:07:33,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2025-02-06 04:07:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 04:07:33,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:33,169 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:33,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-02-06 04:07:33,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:33,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:33,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1657248762, now seen corresponding path program 1 times [2025-02-06 04:07:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776722542] [2025-02-06 04:07:33,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:33,375 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:07:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:33,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:33,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 04:07:33,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 04:07:33,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 04:07:33,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:33,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:33,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:07:33,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:33,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 04:07:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:33,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:33,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776722542] [2025-02-06 04:07:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776722542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:33,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508070922] [2025-02-06 04:07:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:33,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:07:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:33,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:07:33,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:33,912 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:35,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:07:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:37,723 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2025-02-06 04:07:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:37,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-02-06 04:07:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:37,727 INFO L225 Difference]: With dead ends: 246 [2025-02-06 04:07:37,727 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 04:07:37,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:37,731 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 154 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:37,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 453 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-06 04:07:37,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 04:07:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-02-06 04:07:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2025-02-06 04:07:37,747 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 148 [2025-02-06 04:07:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:37,747 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2025-02-06 04:07:37,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2025-02-06 04:07:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-06 04:07:37,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:37,748 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 04:07:37,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:37,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:37,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -444222056, now seen corresponding path program 1 times [2025-02-06 04:07:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57999215] [2025-02-06 04:07:37,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:37,949 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:07:37,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:37,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:37,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 04:07:38,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 04:07:38,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 04:07:38,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:38,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:38,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:07:38,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:38,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 04:07:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:07:38,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:38,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:38,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57999215] [2025-02-06 04:07:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57999215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501818570] [2025-02-06 04:07:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:38,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:07:38,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:38,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:07:38,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:38,464 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:39,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:07:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:41,573 INFO L93 Difference]: Finished difference Result 246 states and 344 transitions. [2025-02-06 04:07:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:41,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-02-06 04:07:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:41,574 INFO L225 Difference]: With dead ends: 246 [2025-02-06 04:07:41,574 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 04:07:41,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:41,575 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 143 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:41,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 448 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-06 04:07:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 04:07:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-02-06 04:07:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2025-02-06 04:07:41,579 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 150 [2025-02-06 04:07:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:41,579 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2025-02-06 04:07:41,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2025-02-06 04:07:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 04:07:41,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:41,580 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:41,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-02-06 04:07:41,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:41,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:41,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:41,782 INFO L85 PathProgramCache]: Analyzing trace with hash 182919290, now seen corresponding path program 1 times [2025-02-06 04:07:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937282428] [2025-02-06 04:07:41,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:41,782 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:07:41,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:41,784 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:41,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 04:07:41,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 04:07:42,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 04:07:42,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:42,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:42,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:07:42,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:42,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:07:42,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-02-06 04:07:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 04:07:42,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:42,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:42,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937282428] [2025-02-06 04:07:42,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937282428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:42,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:42,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:42,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687138746] [2025-02-06 04:07:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:42,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:07:42,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:42,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:07:42,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:42,398 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:43,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:07:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:46,145 INFO L93 Difference]: Finished difference Result 246 states and 342 transitions. [2025-02-06 04:07:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:46,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2025-02-06 04:07:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:46,147 INFO L225 Difference]: With dead ends: 246 [2025-02-06 04:07:46,147 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 04:07:46,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:46,148 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 118 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:46,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 447 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-06 04:07:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 04:07:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-02-06 04:07:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 105 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2025-02-06 04:07:46,153 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 152 [2025-02-06 04:07:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:46,153 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2025-02-06 04:07:46,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2025-02-06 04:07:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 04:07:46,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:46,154 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:46,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-02-06 04:07:46,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:46,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:46,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:46,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1378520168, now seen corresponding path program 1 times [2025-02-06 04:07:46,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:46,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128436024] [2025-02-06 04:07:46,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:46,356 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:07:46,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:46,358 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:46,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 04:07:46,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 04:07:46,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 04:07:46,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:46,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:46,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:07:46,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:46,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:07:46,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-02-06 04:07:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-02-06 04:07:47,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:47,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:47,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128436024] [2025-02-06 04:07:47,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128436024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:47,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549770074] [2025-02-06 04:07:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:47,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:07:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:47,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:07:47,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:47,019 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:48,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:07:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:51,246 INFO L93 Difference]: Finished difference Result 246 states and 340 transitions. [2025-02-06 04:07:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-02-06 04:07:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:51,251 INFO L225 Difference]: With dead ends: 246 [2025-02-06 04:07:51,251 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 04:07:51,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:51,252 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:51,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 441 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 04:07:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 04:07:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-02-06 04:07:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:07:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2025-02-06 04:07:51,261 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 154 [2025-02-06 04:07:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:51,261 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2025-02-06 04:07:51,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 04:07:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2025-02-06 04:07:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:07:51,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:51,262 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-06 04:07:51,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:51,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:51,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1113733242, now seen corresponding path program 1 times [2025-02-06 04:07:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154488565] [2025-02-06 04:07:51,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:51,464 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:07:51,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:51,466 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:51,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 04:07:51,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:07:52,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:07:52,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:52,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:52,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 04:07:52,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:07:52,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:52,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154488565] [2025-02-06 04:07:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154488565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:52,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:52,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:07:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683525854] [2025-02-06 04:07:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:52,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:07:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:52,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:07:52,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:52,707 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:07:55,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 04:07:58,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:04,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:06,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:08:10,731 INFO L93 Difference]: Finished difference Result 293 states and 398 transitions. [2025-02-06 04:08:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:08:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-02-06 04:08:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:08:10,736 INFO L225 Difference]: With dead ends: 293 [2025-02-06 04:08:10,736 INFO L226 Difference]: Without dead ends: 172 [2025-02-06 04:08:10,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:08:10,737 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 51 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:08:10,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 383 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 17.7s Time] [2025-02-06 04:08:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-06 04:08:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 127. [2025-02-06 04:08:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 108 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:08:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2025-02-06 04:08:10,741 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 156 [2025-02-06 04:08:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:08:10,742 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2025-02-06 04:08:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:08:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2025-02-06 04:08:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:08:10,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:10,743 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:10,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 04:08:10,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:08:10,947 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:10,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash 634965142, now seen corresponding path program 1 times [2025-02-06 04:08:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:08:10,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348967395] [2025-02-06 04:08:10,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:10,949 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:08:10,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:08:10,952 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:08:10,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 04:08:11,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:08:12,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:08:12,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:12,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:12,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 04:08:12,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:08:39,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2025-02-06 04:08:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:08:39,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:08:39,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:08:39,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348967395] [2025-02-06 04:08:39,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348967395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:08:39,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:08:39,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:08:39,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926947367] [2025-02-06 04:08:39,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:08:39,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:08:39,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:08:39,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:08:39,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:08:39,745 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:08:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:08:41,980 INFO L93 Difference]: Finished difference Result 251 states and 345 transitions. [2025-02-06 04:08:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:08:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-02-06 04:08:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:08:41,983 INFO L225 Difference]: With dead ends: 251 [2025-02-06 04:08:41,983 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 04:08:41,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:08:41,985 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 74 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:08:41,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 272 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 04:08:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 04:08:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-06 04:08:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 04:08:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2025-02-06 04:08:41,992 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 156 [2025-02-06 04:08:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:08:41,992 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2025-02-06 04:08:41,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-06 04:08:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2025-02-06 04:08:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 04:08:41,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:08:41,994 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:42,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-02-06 04:08:42,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:08:42,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:08:42,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:08:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash 665984949, now seen corresponding path program 1 times [2025-02-06 04:08:42,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:08:42,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060167968] [2025-02-06 04:08:42,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:08:42,197 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:08:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:08:42,200 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:08:42,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-06 04:08:42,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 04:08:42,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 04:08:42,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:08:42,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:08:42,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:08:42,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:08:43,616 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 04:08:43,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-02-06 04:08:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-06 04:08:43,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:08:43,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:08:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060167968] [2025-02-06 04:08:43,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060167968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:08:43,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:08:43,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:08:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560409926] [2025-02-06 04:08:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:08:43,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:08:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:08:43,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:08:43,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:08:43,880 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17)