./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:12:35,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:12:35,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:12:35,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:12:35,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:12:35,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:12:35,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:12:35,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:12:35,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:12:35,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:12:35,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:12:35,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:12:35,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:12:35,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:12:35,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:35,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:12:35,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:12:35,139 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/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 -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2025-03-17 06:12:35,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:12:35,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:12:35,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:12:35,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:12:35,410 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:12:35,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2025-03-17 06:12:36,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0370f2063/ab86b7cd2c9645d39460c4755bffd652/FLAG977f1b794 [2025-03-17 06:12:36,961 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:12:36,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2025-03-17 06:12:36,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0370f2063/ab86b7cd2c9645d39460c4755bffd652/FLAG977f1b794 [2025-03-17 06:12:36,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0370f2063/ab86b7cd2c9645d39460c4755bffd652 [2025-03-17 06:12:36,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:12:36,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:12:36,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:36,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:12:36,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:12:36,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:36" (1/1) ... [2025-03-17 06:12:37,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a707027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:36, skipping insertion in model container [2025-03-17 06:12:37,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:36" (1/1) ... [2025-03-17 06:12:37,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:12:37,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i[917,930] [2025-03-17 06:12:37,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:37,210 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:12:37,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i[917,930] [2025-03-17 06:12:37,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:37,261 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:12:37,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37 WrapperNode [2025-03-17 06:12:37,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:37,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:37,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:12:37,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:12:37,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,317 INFO L138 Inliner]: procedures = 30, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2025-03-17 06:12:37,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:37,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:12:37,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:12:37,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:12:37,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,345 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:12:37,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:12:37,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:12:37,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:12:37,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:12:37,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (1/1) ... [2025-03-17 06:12:37,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:37,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:37,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:12:37,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:12:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:12:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:12:37,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:12:37,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:12:37,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:12:37,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:12:38,082 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-17 06:12:38,121 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-17 06:12:38,121 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:12:38,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:12:38,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:12:38,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:38 BoogieIcfgContainer [2025-03-17 06:12:38,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:12:38,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:12:38,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:12:38,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:12:38,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:12:36" (1/3) ... [2025-03-17 06:12:38,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f66c666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:38, skipping insertion in model container [2025-03-17 06:12:38,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:37" (2/3) ... [2025-03-17 06:12:38,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f66c666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:38, skipping insertion in model container [2025-03-17 06:12:38,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:38" (3/3) ... [2025-03-17 06:12:38,143 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2025-03-17 06:12:38,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:12:38,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-73.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:12:38,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:12:38,219 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;@6ccc0f2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:12:38,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:12:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:12:38,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:38,239 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:38,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:38,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1294897368, now seen corresponding path program 1 times [2025-03-17 06:12:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465394978] [2025-03-17 06:12:38,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:38,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:12:38,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:12:38,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:38,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 06:12:38,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:38,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465394978] [2025-03-17 06:12:38,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465394978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:38,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319460426] [2025-03-17 06:12:38,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:38,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:38,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:38,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:38,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:12:38,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:12:38,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:12:38,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:38,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:38,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:12:38,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 06:12:38,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319460426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:38,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:12:38,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573179443] [2025-03-17 06:12:38,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:12:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:38,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:12:38,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:38,940 INFO L87 Difference]: Start difference. First operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:38,965 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2025-03-17 06:12:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:12:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-17 06:12:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:38,976 INFO L225 Difference]: With dead ends: 203 [2025-03-17 06:12:38,976 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 06:12:38,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-03-17 06:12:38,982 INFO L435 NwaCegarLoop]: 150 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, 150 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-03-17 06:12:38,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 06:12:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 06:12:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-17 06:12:39,018 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 124 [2025-03-17 06:12:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:39,018 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-17 06:12:39,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-03-17 06:12:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:12:39,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:39,021 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:39,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:12:39,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:12:39,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:39,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash -345635959, now seen corresponding path program 1 times [2025-03-17 06:12:39,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:39,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050676476] [2025-03-17 06:12:39,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:39,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:12:39,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:12:39,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:39,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 06:12:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:39,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050676476] [2025-03-17 06:12:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050676476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:39,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339589195] [2025-03-17 06:12:39,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:39,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:39,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:39,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:39,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:12:39,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:12:40,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:12:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:40,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:12:40,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:40,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339589195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:40,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:40,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:12:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099765732] [2025-03-17 06:12:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:40,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:40,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:40,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:40,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:40,083 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:40,130 INFO L93 Difference]: Finished difference Result 204 states and 303 transitions. [2025-03-17 06:12:40,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-17 06:12:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:40,132 INFO L225 Difference]: With dead ends: 204 [2025-03-17 06:12:40,133 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 06:12:40,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 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-03-17 06:12:40,137 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 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-03-17 06:12:40,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 06:12:40,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 06:12:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-03-17 06:12:40,153 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 124 [2025-03-17 06:12:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:40,154 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-03-17 06:12:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-03-17 06:12:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:12:40,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:40,155 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:40,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:12:40,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 06:12:40,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:40,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash 541867722, now seen corresponding path program 1 times [2025-03-17 06:12:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788461256] [2025-03-17 06:12:40,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:40,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:12:40,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:12:40,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:40,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 06:12:40,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:40,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788461256] [2025-03-17 06:12:40,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788461256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:40,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330173687] [2025-03-17 06:12:40,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:40,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:40,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:40,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:12:40,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:12:40,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:12:40,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:40,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:40,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:12:40,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:40,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:40,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330173687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:40,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:40,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:12:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69750571] [2025-03-17 06:12:40,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:40,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:40,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:40,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:40,921 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:40,953 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2025-03-17 06:12:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:40,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-17 06:12:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:40,955 INFO L225 Difference]: With dead ends: 208 [2025-03-17 06:12:40,957 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 06:12:40,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 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-03-17 06:12:40,958 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 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-03-17 06:12:40,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 06:12:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 06:12:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 88 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2025-03-17 06:12:40,974 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 124 [2025-03-17 06:12:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:40,974 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2025-03-17 06:12:40,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2025-03-17 06:12:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:12:40,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:40,976 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:40,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:12:41,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:41,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:41,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash 542791243, now seen corresponding path program 1 times [2025-03-17 06:12:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139879112] [2025-03-17 06:12:41,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:41,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:12:41,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:12:41,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:41,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 06:12:41,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:41,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139879112] [2025-03-17 06:12:41,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139879112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:41,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467266320] [2025-03-17 06:12:41,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:41,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:41,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:41,499 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:41,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:12:41,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:12:41,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:12:41,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:41,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:12:41,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:41,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:41,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467266320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:41,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:41,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:12:41,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290109388] [2025-03-17 06:12:41,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:41,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:41,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:41,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:41,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:12:41,803 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:41,830 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2025-03-17 06:12:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:41,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-17 06:12:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:41,832 INFO L225 Difference]: With dead ends: 211 [2025-03-17 06:12:41,832 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 06:12:41,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:12:41,834 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:41,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 06:12:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 06:12:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-17 06:12:41,842 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 124 [2025-03-17 06:12:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:41,843 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-17 06:12:41,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-17 06:12:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:12:41,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:41,845 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:41,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 06:12:42,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:42,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:42,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash 978524809, now seen corresponding path program 1 times [2025-03-17 06:12:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293031437] [2025-03-17 06:12:42,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:42,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:12:42,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:12:42,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:42,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:42,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:42,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293031437] [2025-03-17 06:12:42,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293031437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:42,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:42,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:12:42,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274033943] [2025-03-17 06:12:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:42,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:12:42,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:42,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:12:42,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:12:42,456 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:42,681 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2025-03-17 06:12:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:12:42,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-17 06:12:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:42,684 INFO L225 Difference]: With dead ends: 215 [2025-03-17 06:12:42,684 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 06:12:42,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03-17 06:12:42,685 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:42,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:12:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 06:12:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 06:12:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2025-03-17 06:12:42,695 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 126 [2025-03-17 06:12:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:42,696 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2025-03-17 06:12:42,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2025-03-17 06:12:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:12:42,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:42,698 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:42,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:12:42,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:42,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash 569700584, now seen corresponding path program 1 times [2025-03-17 06:12:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269902266] [2025-03-17 06:12:42,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:42,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:12:42,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:12:42,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:42,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:44,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269902266] [2025-03-17 06:12:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269902266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:44,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:44,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:12:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315289219] [2025-03-17 06:12:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:44,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:12:44,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:44,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:12:44,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:44,645 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:45,285 INFO L93 Difference]: Finished difference Result 285 states and 417 transitions. [2025-03-17 06:12:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:12:45,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-03-17 06:12:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:45,287 INFO L225 Difference]: With dead ends: 285 [2025-03-17 06:12:45,287 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 06:12:45,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:45,288 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:45,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 480 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:12:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 06:12:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2025-03-17 06:12:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.385185185185185) internal successors, (187), 135 states have internal predecessors, (187), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 06:12:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 247 transitions. [2025-03-17 06:12:45,314 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 247 transitions. Word has length 126 [2025-03-17 06:12:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:45,314 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 247 transitions. [2025-03-17 06:12:45,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 247 transitions. [2025-03-17 06:12:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:12:45,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:45,316 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:45,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:12:45,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:45,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 242504745, now seen corresponding path program 1 times [2025-03-17 06:12:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:45,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76743190] [2025-03-17 06:12:45,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:45,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:12:45,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:12:45,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:45,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:45,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:45,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76743190] [2025-03-17 06:12:45,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76743190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:45,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880854889] [2025-03-17 06:12:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:45,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:45,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:45,790 INFO L87 Difference]: Start difference. First operand 168 states and 247 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:46,279 INFO L93 Difference]: Finished difference Result 276 states and 404 transitions. [2025-03-17 06:12:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:46,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-17 06:12:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:46,283 INFO L225 Difference]: With dead ends: 276 [2025-03-17 06:12:46,284 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 06:12:46,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:46,285 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 113 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:46,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 511 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 06:12:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 107. [2025-03-17 06:12:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-17 06:12:46,298 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 127 [2025-03-17 06:12:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:46,298 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-17 06:12:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-17 06:12:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:12:46,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:46,299 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:46,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:12:46,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:46,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1794990899, now seen corresponding path program 1 times [2025-03-17 06:12:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:46,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771655] [2025-03-17 06:12:46,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:46,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:12:46,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:12:46,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:46,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:47,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:47,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771655] [2025-03-17 06:12:47,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:47,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:47,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:47,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525386528] [2025-03-17 06:12:47,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:47,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:47,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:47,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:47,858 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:12:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:48,181 INFO L93 Difference]: Finished difference Result 279 states and 408 transitions. [2025-03-17 06:12:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:48,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-03-17 06:12:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:48,183 INFO L225 Difference]: With dead ends: 279 [2025-03-17 06:12:48,184 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 06:12:48,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:48,185 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 93 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:48,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 343 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 06:12:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2025-03-17 06:12:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 06:12:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 243 transitions. [2025-03-17 06:12:48,199 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 243 transitions. Word has length 127 [2025-03-17 06:12:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:48,199 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 243 transitions. [2025-03-17 06:12:48,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:12:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2025-03-17 06:12:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:12:48,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:48,201 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:48,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:12:48,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:48,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2006341812, now seen corresponding path program 1 times [2025-03-17 06:12:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:48,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119234948] [2025-03-17 06:12:48,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:48,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:12:48,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:12:48,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:48,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:50,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:50,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119234948] [2025-03-17 06:12:50,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119234948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:50,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:50,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:50,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121334142] [2025-03-17 06:12:50,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:50,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:50,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:50,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:50,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:50,289 INFO L87 Difference]: Start difference. First operand 166 states and 243 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:12:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:50,808 INFO L93 Difference]: Finished difference Result 320 states and 463 transitions. [2025-03-17 06:12:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:50,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-03-17 06:12:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:50,810 INFO L225 Difference]: With dead ends: 320 [2025-03-17 06:12:50,810 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 06:12:50,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 06:12:50,810 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 215 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:50,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 294 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 06:12:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 171. [2025-03-17 06:12:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 138 states have internal predecessors, (189), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 06:12:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 249 transitions. [2025-03-17 06:12:50,825 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 249 transitions. Word has length 127 [2025-03-17 06:12:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:50,826 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 249 transitions. [2025-03-17 06:12:50,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 06:12:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 249 transitions. [2025-03-17 06:12:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 06:12:50,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:50,827 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:12:50,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:12:50,828 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:50,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1495807635, now seen corresponding path program 1 times [2025-03-17 06:12:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:50,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426926153] [2025-03-17 06:12:50,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:50,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:12:50,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:12:50,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:50,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:12:50,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:12:50,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 06:12:51,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 06:12:51,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:51,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:12:51,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:12:51,118 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:12:51,119 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:12:51,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:12:51,124 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:51,241 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:12:51,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:12:51 BoogieIcfgContainer [2025-03-17 06:12:51,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:12:51,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:12:51,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:12:51,246 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:12:51,246 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:38" (3/4) ... [2025-03-17 06:12:51,248 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:12:51,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:12:51,249 INFO L158 Benchmark]: Toolchain (without parser) took 14258.16ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 106.4MB in the beginning and 379.9MB in the end (delta: -273.5MB). Peak memory consumption was 162.1MB. Max. memory is 16.1GB. [2025-03-17 06:12:51,249 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:51,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.93ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 90.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:12:51,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.05ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 86.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:51,250 INFO L158 Benchmark]: Boogie Preprocessor took 44.59ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:12:51,251 INFO L158 Benchmark]: IcfgBuilder took 769.86ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 48.4MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:12:51,251 INFO L158 Benchmark]: TraceAbstraction took 13110.23ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 48.4MB in the beginning and 380.1MB in the end (delta: -331.6MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. [2025-03-17 06:12:51,251 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 578.8MB. Free memory was 380.1MB in the beginning and 379.9MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:51,252 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.37ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.93ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 90.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.05ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 86.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.59ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 84.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 769.86ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 48.4MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13110.23ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 48.4MB in the beginning and 380.1MB in the end (delta: -331.6MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 578.8MB. Free memory was 380.1MB in the beginning and 379.9MB in the end (delta: 184.7kB). 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 125, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 109. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L55] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L58] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L59] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L61] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L62] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L69] float last_1_WrapperStruct00_var_1_12 = 15.75; [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] CALL updateLastVariables() [L131] EXPR WrapperStruct00.var_1_12 [L131] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L110] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L116] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L126] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L142] RET updateVariables() [L143] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L73] COND FALSE !((*(WrapperStruct00_var_1_6_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L76] COND FALSE !(last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L80] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L81] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] signed long int stepLocal_0 = ((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))); [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4, stepLocal_0=50] [L95] COND TRUE (*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_0 [L96] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L96] COND TRUE ! (*(WrapperStruct00_var_1_6_Pointer)) [L97] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L97] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L102] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L102] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L143] RET step() [L144] CALL, EXPR property() [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 [L134] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134-L135] return ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 169 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 489 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 489 mSDsluCounter, 3549 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2401 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1521 IncrementalHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 1148 mSDtfsCounter, 1521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 532 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=9, InterpolantAutomatonStates: 46, 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, 9 MinimizatonAttempts, 122 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1752 NumberOfCodeBlocks, 1752 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1612 ConstructedInterpolants, 0 QuantifiedInterpolants, 5856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2105 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 5306/5460 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-03-17 06:12:51,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:12:53,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:12:53,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:12:53,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:12:53,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:12:53,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:12:53,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:12:53,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:12:53,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:12:53,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:12:53,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:12:53,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:12:53,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:12:53,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:12:53,802 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:12:53,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:12:53,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:12:53,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:53,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:12:53,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:12:53,804 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/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 -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2025-03-17 06:12:54,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:12:54,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:12:54,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:12:54,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:12:54,138 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:12:54,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2025-03-17 06:12:55,433 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc1bf268/91a27b9c43f14f5693653e8264c55899/FLAG2405369d5 [2025-03-17 06:12:55,678 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:12:55,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2025-03-17 06:12:55,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc1bf268/91a27b9c43f14f5693653e8264c55899/FLAG2405369d5 [2025-03-17 06:12:55,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfc1bf268/91a27b9c43f14f5693653e8264c55899 [2025-03-17 06:12:55,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:12:55,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:12:55,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:55,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:12:55,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:12:55,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:55" (1/1) ... [2025-03-17 06:12:55,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41db1779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:55, skipping insertion in model container [2025-03-17 06:12:55,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:55" (1/1) ... [2025-03-17 06:12:55,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:12:55,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i[917,930] [2025-03-17 06:12:55,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:55,934 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:12:55,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i[917,930] [2025-03-17 06:12:55,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:56,019 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:12:56,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56 WrapperNode [2025-03-17 06:12:56,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:56,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:56,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:12:56,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:12:56,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,077 INFO L138 Inliner]: procedures = 37, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2025-03-17 06:12:56,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:56,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:12:56,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:12:56,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:12:56,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,123 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-03-17 06:12:56,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,145 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:12:56,155 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:12:56,155 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:12:56,155 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:12:56,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (1/1) ... [2025-03-17 06:12:56,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:56,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:56,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:12:56,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:12:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:12:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:12:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:12:56,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:12:56,345 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:12:56,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:13:01,198 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-17 06:13:01,243 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-17 06:13:01,243 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:13:01,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:13:01,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:13:01,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:13:01 BoogieIcfgContainer [2025-03-17 06:13:01,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:13:01,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:13:01,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:13:01,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:13:01,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:12:55" (1/3) ... [2025-03-17 06:13:01,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4689dc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:13:01, skipping insertion in model container [2025-03-17 06:13:01,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:56" (2/3) ... [2025-03-17 06:13:01,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4689dc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:13:01, skipping insertion in model container [2025-03-17 06:13:01,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:13:01" (3/3) ... [2025-03-17 06:13:01,258 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2025-03-17 06:13:01,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:13:01,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-73.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:13:01,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:13:01,333 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;@73597ec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:13:01,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:13:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:13:01,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:01,349 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:01,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:01,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash 281557133, now seen corresponding path program 1 times [2025-03-17 06:13:01,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:01,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128074548] [2025-03-17 06:13:01,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:01,363 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-03-17 06:13:01,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:01,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-17 06:13:01,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:01,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:13:01,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:13:01,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:01,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:01,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:13:01,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-17 06:13:01,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:01,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128074548] [2025-03-17 06:13:01,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128074548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:01,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:01,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:13:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072847252] [2025-03-17 06:13:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:01,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:13:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:01,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:13:01,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:13:01,806 INFO L87 Difference]: Start difference. First operand has 103 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:13:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:01,830 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2025-03-17 06:13:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:13:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-17 06:13:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:01,839 INFO L225 Difference]: With dead ends: 203 [2025-03-17 06:13:01,839 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 06:13:01,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-03-17 06:13:01,844 INFO L435 NwaCegarLoop]: 150 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, 150 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-03-17 06:13:01,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:13:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 06:13:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 06:13:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-17 06:13:01,875 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 124 [2025-03-17 06:13:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-17 06:13:01,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:13:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-03-17 06:13:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:13:01,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:01,879 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:01,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:02,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-17 06:13:02,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:02,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:02,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1230818542, now seen corresponding path program 1 times [2025-03-17 06:13:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:02,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826071421] [2025-03-17 06:13:02,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:02,082 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-03-17 06:13:02,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:02,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-17 06:13:02,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:02,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:13:02,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:13:02,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:02,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:02,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:13:02,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:13:02,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:02,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:02,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826071421] [2025-03-17 06:13:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826071421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:13:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977848783] [2025-03-17 06:13:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:02,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:13:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:02,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:13:02,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:02,537 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:02,593 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2025-03-17 06:13:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:13:02,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-17 06:13:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:02,600 INFO L225 Difference]: With dead ends: 203 [2025-03-17 06:13:02,600 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 06:13:02,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:02,602 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:02,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:13:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 06:13:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 06:13:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-03-17 06:13:02,614 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 124 [2025-03-17 06:13:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:02,617 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-03-17 06:13:02,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-03-17 06:13:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:13:02,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:02,619 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:02,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:13:02,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-17 06:13:02,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:02,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1060582292, now seen corresponding path program 1 times [2025-03-17 06:13:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:02,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669489053] [2025-03-17 06:13:02,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:02,822 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-03-17 06:13:02,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:02,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-17 06:13:02,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:02,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:13:03,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:13:03,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:03,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:03,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:13:03,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:13:03,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:03,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:03,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669489053] [2025-03-17 06:13:03,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669489053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:03,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:03,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:13:03,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066526071] [2025-03-17 06:13:03,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:03,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:13:03,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:03,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:13:03,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:13:03,195 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:03,287 INFO L93 Difference]: Finished difference Result 210 states and 310 transitions. [2025-03-17 06:13:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:13:03,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-17 06:13:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:03,290 INFO L225 Difference]: With dead ends: 210 [2025-03-17 06:13:03,290 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 06:13:03,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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-03-17 06:13:03,292 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 564 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:03,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 564 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:13:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 06:13:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-17 06:13:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-17 06:13:03,301 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 126 [2025-03-17 06:13:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:03,301 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-17 06:13:03,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-17 06:13:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:13:03,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:03,303 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:03,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:03,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-17 06:13:03,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:03,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash -173078611, now seen corresponding path program 1 times [2025-03-17 06:13:03,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:03,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426109162] [2025-03-17 06:13:03,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:03,506 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-03-17 06:13:03,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:03,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-17 06:13:03,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:03,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:13:03,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:13:03,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:03,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:03,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:13:03,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:13:03,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:03,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:03,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426109162] [2025-03-17 06:13:03,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426109162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:03,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:03,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:13:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113009376] [2025-03-17 06:13:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:13:03,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:03,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:13:03,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:13:03,936 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:04,020 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2025-03-17 06:13:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:13:04,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-03-17 06:13:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:04,022 INFO L225 Difference]: With dead ends: 216 [2025-03-17 06:13:04,023 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 06:13:04,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 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-03-17 06:13:04,024 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:04,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 699 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:13:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 06:13:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 06:13:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2025-03-17 06:13:04,031 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 126 [2025-03-17 06:13:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:04,031 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2025-03-17 06:13:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2025-03-17 06:13:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:13:04,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:04,035 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:04,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:04,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-17 06:13:04,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:04,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash -172155090, now seen corresponding path program 1 times [2025-03-17 06:13:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:04,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647918983] [2025-03-17 06:13:04,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:04,237 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-03-17 06:13:04,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:04,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-17 06:13:04,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:04,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:13:04,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:13:04,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:04,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:04,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:13:04,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:04,853 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-03-17 06:13:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-17 06:13:04,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:04,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647918983] [2025-03-17 06:13:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647918983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:04,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:04,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:13:04,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581825274] [2025-03-17 06:13:04,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:04,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:13:04,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:04,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:13:04,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:13:04,899 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:13:06,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:13:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:08,807 INFO L93 Difference]: Finished difference Result 218 states and 316 transitions. [2025-03-17 06:13:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:13:08,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-03-17 06:13:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:08,810 INFO L225 Difference]: With dead ends: 218 [2025-03-17 06:13:08,810 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 06:13:08,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 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-03-17 06:13:08,811 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 121 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:08,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 420 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-17 06:13:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 06:13:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 06:13:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-17 06:13:08,824 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 126 [2025-03-17 06:13:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:08,825 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-17 06:13:08,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:13:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-17 06:13:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:13:08,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:08,826 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:08,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:09,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-17 06:13:09,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:09,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2051253964, now seen corresponding path program 1 times [2025-03-17 06:13:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:09,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609026682] [2025-03-17 06:13:09,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:09,029 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-03-17 06:13:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:09,032 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-17 06:13:09,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:09,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:13:09,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:13:09,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:09,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:09,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:13:09,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:09,657 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-03-17 06:13:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 06:13:09,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:09,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609026682] [2025-03-17 06:13:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609026682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:09,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:09,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:13:09,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145040416] [2025-03-17 06:13:09,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:09,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:13:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:09,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:13:09,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:13:09,686 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:13:10,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:13:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:13,828 INFO L93 Difference]: Finished difference Result 218 states and 314 transitions. [2025-03-17 06:13:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:13:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-03-17 06:13:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:13,830 INFO L225 Difference]: With dead ends: 218 [2025-03-17 06:13:13,830 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 06:13:13,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:13:13,831 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:13,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 416 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 06:13:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 06:13:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 06:13:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-17 06:13:13,840 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 128 [2025-03-17 06:13:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:13,841 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-17 06:13:13,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:13:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-17 06:13:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:13:13,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:13,842 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:13,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:14,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-03-17 06:13:14,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:14,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2141679186, now seen corresponding path program 1 times [2025-03-17 06:13:14,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:14,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492617160] [2025-03-17 06:13:14,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:14,044 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-03-17 06:13:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:14,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-03-17 06:13:14,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:14,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:13:14,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:13:14,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:14,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:14,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:13:14,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:14,468 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 18 treesize of output 10 [2025-03-17 06:13:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:13:14,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:14,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492617160] [2025-03-17 06:13:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492617160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:14,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:13:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383131818] [2025-03-17 06:13:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:14,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:13:14,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:14,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:13:14,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:14,505 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:15,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:13:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:17,500 INFO L93 Difference]: Finished difference Result 219 states and 314 transitions. [2025-03-17 06:13:17,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:13:17,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 06:13:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:17,504 INFO L225 Difference]: With dead ends: 219 [2025-03-17 06:13:17,504 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 06:13:17,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:17,506 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:17,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-17 06:13:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 06:13:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 06:13:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-03-17 06:13:17,512 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 130 [2025-03-17 06:13:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:17,512 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-03-17 06:13:17,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-03-17 06:13:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:13:17,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:17,513 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:17,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 06:13:17,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-03-17 06:13:17,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:17,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1744463885, now seen corresponding path program 1 times [2025-03-17 06:13:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:17,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796614149] [2025-03-17 06:13:17,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:17,715 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-03-17 06:13:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:17,717 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-03-17 06:13:17,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:17,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:13:18,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:13:18,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:18,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:18,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:13:18,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:18,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:13:18,201 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 46 treesize of output 34 [2025-03-17 06:13:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:13:18,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:18,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:18,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796614149] [2025-03-17 06:13:18,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796614149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:18,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:18,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:13:18,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479717347] [2025-03-17 06:13:18,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:18,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:13:18,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:18,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:13:18,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:13:18,237 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:19,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:20,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:13:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:23,121 INFO L93 Difference]: Finished difference Result 221 states and 315 transitions. [2025-03-17 06:13:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:13:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 06:13:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:23,122 INFO L225 Difference]: With dead ends: 221 [2025-03-17 06:13:23,122 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 06:13:23,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:13:23,123 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:23,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-17 06:13:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 06:13:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-03-17 06:13:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:13:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-03-17 06:13:23,133 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 130 [2025-03-17 06:13:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:23,133 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-03-17 06:13:23,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:13:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-03-17 06:13:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 06:13:23,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:23,134 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 06:13:23,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:23,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-03-17 06:13:23,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:23,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -442052430, now seen corresponding path program 1 times [2025-03-17 06:13:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991828007] [2025-03-17 06:13:23,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:23,336 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-03-17 06:13:23,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:23,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-03-17 06:13:23,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-17 06:13:23,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:13:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:13:23,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:23,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:23,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 06:13:23,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:23,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:13:23,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:13:23,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:13:23,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:13:23,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:13:23,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:13:23,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 61 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 42 [2025-03-17 06:13:24,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2025-03-17 06:13:25,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2025-03-17 06:13:30,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 83 [2025-03-17 06:13:35,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2025-03-17 06:13:36,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2025-03-17 06:13:36,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2025-03-17 06:13:38,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2025-03-17 06:13:38,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2025-03-17 06:13:39,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 98 [2025-03-17 06:13:40,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 103 [2025-03-17 06:13:40,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 101 [2025-03-17 06:13:40,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:13:40,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 98 treesize of output 50 [2025-03-17 06:13:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 32 proven. 348 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:13:41,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:13:41,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:41,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991828007] [2025-03-17 06:13:41,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991828007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:13:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [713171684] [2025-03-17 06:13:41,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:41,523 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:13:41,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:13:41,525 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:13:41,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-17 06:13:41,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 06:13:43,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 06:13:43,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:43,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:43,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 06:13:43,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:43,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 8 [2025-03-17 06:13:43,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 06:13:43,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2025-03-17 06:13:44,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 06:13:44,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 06:13:44,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 06:13:45,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 06:13:45,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-17 06:13:46,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-17 06:13:46,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2025-03-17 06:13:47,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2025-03-17 06:13:47,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2025-03-17 06:13:47,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 29 [2025-03-17 06:13:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 104 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-17 06:13:47,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:13:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [713171684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:13:47,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:13:47,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2025-03-17 06:13:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258029684] [2025-03-17 06:13:47,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:13:47,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 06:13:47,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:47,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 06:13:47,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=385, Unknown=2, NotChecked=0, Total=462 [2025-03-17 06:13:47,957 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 17 states have internal predecessors, (121), 10 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2025-03-17 06:13:50,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:51,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:52,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:55,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:57,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:58,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:59,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:14:01,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:14:02,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:14:03,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]