./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-ap_file-39.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 b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:16:34,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:16:34,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:16:34,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:16:34,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:16:34,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:16:34,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:16:34,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:16:34,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:16:34,095 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:16:34,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:16:34,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:16:34,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:16:34,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:16:34,097 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:16:34,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:16:34,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:16:34,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:16:34,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:16:34,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:16:34,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:16:34,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:16:34,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:16:34,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:16:34,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:16:34,099 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:16:34,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:16:34,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:16:34,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:16:34,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:16:34,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:16:34,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:16:34,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:16:34,100 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 -> b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 [2025-03-04 01:16:34,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:16:34,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:16:34,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:16:34,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:16:34,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:16:34,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-04 01:16:35,486 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd36487a/e0e5d88e0bdb48bd9cd5b96490d49b93/FLAG20f191033 [2025-03-04 01:16:35,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:16:35,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-04 01:16:35,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd36487a/e0e5d88e0bdb48bd9cd5b96490d49b93/FLAG20f191033 [2025-03-04 01:16:36,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd36487a/e0e5d88e0bdb48bd9cd5b96490d49b93 [2025-03-04 01:16:36,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:16:36,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:16:36,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:16:36,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:16:36,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:16:36,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29785afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36, skipping insertion in model container [2025-03-04 01:16:36,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:16:36,175 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-ap_file-39.i[917,930] [2025-03-04 01:16:36,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:16:36,226 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:16:36,232 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-ap_file-39.i[917,930] [2025-03-04 01:16:36,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:16:36,262 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:16:36,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36 WrapperNode [2025-03-04 01:16:36,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:16:36,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:16:36,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:16:36,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:16:36,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,299 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 613 [2025-03-04 01:16:36,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:16:36,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:16:36,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:16:36,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:16:36,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,335 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2025-03-04 01:16:36,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:16:36,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:16:36,355 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:16:36,355 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:16:36,361 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (1/1) ... [2025-03-04 01:16:36,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:16:36,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:36,384 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-04 01:16:36,387 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-04 01:16:36,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:16:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:16:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:16:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:16:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:16:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:16:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:16:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:16:36,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:16:36,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:16:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:16:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:16:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:16:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:16:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:16:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:16:36,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:16:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:16:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:16:36,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:16:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:16:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:16:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:16:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:16:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:16:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:16:36,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:16:36,526 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:16:36,528 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:16:36,937 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem113#1;havoc property_#t~mem106#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite131#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem123#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short132#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~bitwise135#1;havoc property_#t~mem137#1;havoc property_#t~ite176#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem142#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite173#1;havoc property_#t~mem170#1;havoc property_#t~mem148#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~ite155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~ite154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~ite169#1;havoc property_#t~mem161#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite160#1;havoc property_#t~mem158#1;havoc property_#t~mem159#1;havoc property_#t~ite168#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~mem172#1;havoc property_#t~mem171#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short177#1; [2025-03-04 01:16:36,977 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2025-03-04 01:16:36,977 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:16:36,990 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:16:36,991 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:16:36,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:36 BoogieIcfgContainer [2025-03-04 01:16:36,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:16:36,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:16:36,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:16:36,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:16:36,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:16:36" (1/3) ... [2025-03-04 01:16:36,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3dd97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:16:36, skipping insertion in model container [2025-03-04 01:16:36,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:16:36" (2/3) ... [2025-03-04 01:16:36,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3dd97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:16:36, skipping insertion in model container [2025-03-04 01:16:36,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:36" (3/3) ... [2025-03-04 01:16:36,999 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-04 01:16:37,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:16:37,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-39.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:16:37,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:16:37,063 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;@7096d856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:16:37,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:16:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 100 states have (on average 1.43) internal successors, (143), 101 states have internal predecessors, (143), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:16:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:16:37,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:37,075 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:37,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:37,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2072192128, now seen corresponding path program 1 times [2025-03-04 01:16:37,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:37,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950969823] [2025-03-04 01:16:37,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:37,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:37,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:16:37,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:16:37,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:37,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:16:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:37,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950969823] [2025-03-04 01:16:37,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950969823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:37,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18827564] [2025-03-04 01:16:37,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:37,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:16:37,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:37,357 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-04 01:16:37,358 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-04 01:16:37,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:16:37,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:16:37,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:37,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:37,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:16:37,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:16:37,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:16:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18827564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:37,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:16:37,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:16:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693923612] [2025-03-04 01:16:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:16:37,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:37,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:16:37,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:16:37,634 INFO L87 Difference]: Start difference. First operand has 119 states, 100 states have (on average 1.43) internal successors, (143), 101 states have internal predecessors, (143), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:16:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:37,659 INFO L93 Difference]: Finished difference Result 232 states and 361 transitions. [2025-03-04 01:16:37,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:16:37,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-03-04 01:16:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:37,666 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:16:37,666 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:16:37,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-04 01:16:37,671 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:37,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:16:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:16:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:16:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:16:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2025-03-04 01:16:37,703 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2025-03-04 01:16:37,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:37,703 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2025-03-04 01:16:37,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:16:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2025-03-04 01:16:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:16:37,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:37,712 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:37,728 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-04 01:16:37,913 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-04 01:16:37,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:37,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1092868498, now seen corresponding path program 1 times [2025-03-04 01:16:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972117816] [2025-03-04 01:16:37,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:37,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:16:38,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:16:38,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:38,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:16:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972117816] [2025-03-04 01:16:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972117816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:16:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570501570] [2025-03-04 01:16:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:16:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:41,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:16:41,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:16:41,135 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:16:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:43,035 INFO L93 Difference]: Finished difference Result 382 states and 559 transitions. [2025-03-04 01:16:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:16:43,035 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-03-04 01:16:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:43,038 INFO L225 Difference]: With dead ends: 382 [2025-03-04 01:16:43,038 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 01:16:43,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:16:43,039 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 504 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:43,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1696 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:16:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 01:16:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2025-03-04 01:16:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 224 states have (on average 1.4330357142857142) internal successors, (321), 226 states have internal predecessors, (321), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:16:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 369 transitions. [2025-03-04 01:16:43,062 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 369 transitions. Word has length 128 [2025-03-04 01:16:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:43,063 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 369 transitions. [2025-03-04 01:16:43,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:16:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 369 transitions. [2025-03-04 01:16:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:16:43,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:43,065 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:43,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:16:43,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:43,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash -714585965, now seen corresponding path program 1 times [2025-03-04 01:16:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:43,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640892782] [2025-03-04 01:16:43,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:43,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:16:43,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:16:43,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:43,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:16:43,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:43,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640892782] [2025-03-04 01:16:43,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640892782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:43,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:43,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:16:43,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663749705] [2025-03-04 01:16:43,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:43,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:16:43,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:43,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:16:43,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:16:43,873 INFO L87 Difference]: Start difference. First operand 252 states and 369 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:16:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:44,427 INFO L93 Difference]: Finished difference Result 587 states and 861 transitions. [2025-03-04 01:16:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:16:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2025-03-04 01:16:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:44,431 INFO L225 Difference]: With dead ends: 587 [2025-03-04 01:16:44,431 INFO L226 Difference]: Without dead ends: 338 [2025-03-04 01:16:44,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:16:44,433 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 609 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:44,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 629 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:16:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-04 01:16:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 274. [2025-03-04 01:16:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 246 states have (on average 1.434959349593496) internal successors, (353), 248 states have internal predecessors, (353), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:16:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2025-03-04 01:16:44,458 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 128 [2025-03-04 01:16:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:44,459 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2025-03-04 01:16:44,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:16:44,460 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2025-03-04 01:16:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:16:44,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:44,462 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:44,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:16:44,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:44,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1848789101, now seen corresponding path program 1 times [2025-03-04 01:16:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418063068] [2025-03-04 01:16:44,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:44,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:16:44,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:16:44,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:44,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:16:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418063068] [2025-03-04 01:16:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418063068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:16:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:16:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:16:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311011207] [2025-03-04 01:16:45,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:16:45,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:16:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:45,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:16:45,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:16:45,067 INFO L87 Difference]: Start difference. First operand 274 states and 401 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:16:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:16:45,524 INFO L93 Difference]: Finished difference Result 553 states and 805 transitions. [2025-03-04 01:16:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:16:45,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-03-04 01:16:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:16:45,526 INFO L225 Difference]: With dead ends: 553 [2025-03-04 01:16:45,526 INFO L226 Difference]: Without dead ends: 282 [2025-03-04 01:16:45,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:16:45,527 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 407 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:16:45,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 681 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:16:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-04 01:16:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 216. [2025-03-04 01:16:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 193 states have (on average 1.4196891191709844) internal successors, (274), 194 states have internal predecessors, (274), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:16:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 312 transitions. [2025-03-04 01:16:45,551 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 312 transitions. Word has length 128 [2025-03-04 01:16:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:16:45,552 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 312 transitions. [2025-03-04 01:16:45,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:16:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 312 transitions. [2025-03-04 01:16:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:16:45,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:16:45,554 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:16:45,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:16:45,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:16:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:16:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 638723732, now seen corresponding path program 1 times [2025-03-04 01:16:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:16:45,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888167956] [2025-03-04 01:16:45,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:16:45,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:16:45,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:16:45,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:45,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:16:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:16:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888167956] [2025-03-04 01:16:47,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888167956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262713073] [2025-03-04 01:16:47,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:16:47,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:16:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:16:47,634 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-04 01:16:47,636 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-04 01:16:47,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:16:47,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:16:47,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:16:47,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:16:47,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 01:16:47,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:16:48,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:16:48,916 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 23 treesize of output 11 [2025-03-04 01:16:49,126 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 23 treesize of output 11 [2025-03-04 01:16:49,666 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 37 treesize of output 24 [2025-03-04 01:16:51,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 117 [2025-03-04 01:16:51,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:51,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:51,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:51,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 125 [2025-03-04 01:16:51,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:51,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:51,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:51,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 108 treesize of output 74 [2025-03-04 01:16:51,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 01:16:51,643 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 19 treesize of output 11 [2025-03-04 01:16:52,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:52,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:52,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:16:52,435 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2025-03-04 01:16:52,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 155 treesize of output 100 [2025-03-04 01:16:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 198 proven. 210 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 01:16:52,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:16:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262713073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:16:54,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:16:54,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 34] total 51 [2025-03-04 01:16:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356325533] [2025-03-04 01:16:54,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:16:54,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 01:16:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:16:54,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 01:16:54,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=3350, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 01:16:54,025 INFO L87 Difference]: Start difference. First operand 216 states and 312 transitions. Second operand has 51 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 47 states have internal predecessors, (119), 12 states have call successors, (32), 7 states have call predecessors, (32), 10 states have return successors, (32), 9 states have call predecessors, (32), 12 states have call successors, (32) [2025-03-04 01:17:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:06,432 INFO L93 Difference]: Finished difference Result 732 states and 1040 transitions. [2025-03-04 01:17:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-04 01:17:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 47 states have internal predecessors, (119), 12 states have call successors, (32), 7 states have call predecessors, (32), 10 states have return successors, (32), 9 states have call predecessors, (32), 12 states have call successors, (32) Word has length 128 [2025-03-04 01:17:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:06,435 INFO L225 Difference]: With dead ends: 732 [2025-03-04 01:17:06,435 INFO L226 Difference]: Without dead ends: 519 [2025-03-04 01:17:06,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3511 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1784, Invalid=12258, Unknown=0, NotChecked=0, Total=14042 [2025-03-04 01:17:06,441 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1413 mSDsluCounter, 5426 mSDsCounter, 0 mSdLazyCounter, 5831 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 5641 SdHoareTripleChecker+Invalid, 6033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 5831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:06,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 5641 Invalid, 6033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 5831 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 01:17:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-04 01:17:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 259. [2025-03-04 01:17:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 231 states have (on average 1.393939393939394) internal successors, (322), 232 states have internal predecessors, (322), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:17:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 360 transitions. [2025-03-04 01:17:06,469 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 360 transitions. Word has length 128 [2025-03-04 01:17:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:06,469 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 360 transitions. [2025-03-04 01:17:06,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 45 states have (on average 2.6444444444444444) internal successors, (119), 47 states have internal predecessors, (119), 12 states have call successors, (32), 7 states have call predecessors, (32), 10 states have return successors, (32), 9 states have call predecessors, (32), 12 states have call successors, (32) [2025-03-04 01:17:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 360 transitions. [2025-03-04 01:17:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:17:06,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:06,471 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:06,479 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-04 01:17:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:17:06,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:06,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1416902062, now seen corresponding path program 1 times [2025-03-04 01:17:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167210544] [2025-03-04 01:17:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:06,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:17:06,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:17:06,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:06,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167210544] [2025-03-04 01:17:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167210544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:07,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:17:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701639007] [2025-03-04 01:17:07,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:07,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:17:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:07,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:17:07,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:17:07,770 INFO L87 Difference]: Start difference. First operand 259 states and 360 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:08,381 INFO L93 Difference]: Finished difference Result 639 states and 895 transitions. [2025-03-04 01:17:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:17:08,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-04 01:17:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:08,384 INFO L225 Difference]: With dead ends: 639 [2025-03-04 01:17:08,384 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 01:17:08,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:17:08,386 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 320 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:08,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1046 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:17:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 01:17:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 253. [2025-03-04 01:17:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 225 states have (on average 1.3955555555555557) internal successors, (314), 226 states have internal predecessors, (314), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:17:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 352 transitions. [2025-03-04 01:17:08,410 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 352 transitions. Word has length 129 [2025-03-04 01:17:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:08,410 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 352 transitions. [2025-03-04 01:17:08,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 352 transitions. [2025-03-04 01:17:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:17:08,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:08,411 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:08,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:17:08,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:08,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1015209449, now seen corresponding path program 1 times [2025-03-04 01:17:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869621258] [2025-03-04 01:17:08,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:08,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:17:08,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:17:08,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:08,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869621258] [2025-03-04 01:17:08,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869621258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:08,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:08,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:17:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358436116] [2025-03-04 01:17:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:08,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:17:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:08,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:17:08,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:17:08,691 INFO L87 Difference]: Start difference. First operand 253 states and 352 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:17:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:09,097 INFO L93 Difference]: Finished difference Result 583 states and 815 transitions. [2025-03-04 01:17:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:17:09,097 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2025-03-04 01:17:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:09,099 INFO L225 Difference]: With dead ends: 583 [2025-03-04 01:17:09,099 INFO L226 Difference]: Without dead ends: 333 [2025-03-04 01:17:09,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:17:09,100 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 498 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:09,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1068 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:17:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-04 01:17:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 265. [2025-03-04 01:17:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 237 states have (on average 1.4050632911392404) internal successors, (333), 238 states have internal predecessors, (333), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:17:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 371 transitions. [2025-03-04 01:17:09,132 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 371 transitions. Word has length 130 [2025-03-04 01:17:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:09,133 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 371 transitions. [2025-03-04 01:17:09,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:17:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 371 transitions. [2025-03-04 01:17:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:17:09,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:09,135 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:09,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:17:09,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:09,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1387816685, now seen corresponding path program 1 times [2025-03-04 01:17:09,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:09,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639332660] [2025-03-04 01:17:09,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:09,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:09,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:17:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:17:09,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:09,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:10,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639332660] [2025-03-04 01:17:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639332660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:10,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:10,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:17:10,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500770885] [2025-03-04 01:17:10,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:10,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:17:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:10,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:17:10,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:17:10,224 INFO L87 Difference]: Start difference. First operand 265 states and 371 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:17:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:11,214 INFO L93 Difference]: Finished difference Result 651 states and 916 transitions. [2025-03-04 01:17:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:17:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 131 [2025-03-04 01:17:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:11,216 INFO L225 Difference]: With dead ends: 651 [2025-03-04 01:17:11,216 INFO L226 Difference]: Without dead ends: 389 [2025-03-04 01:17:11,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:17:11,217 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 348 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:11,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1192 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:17:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-04 01:17:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 263. [2025-03-04 01:17:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 235 states have (on average 1.4042553191489362) internal successors, (330), 236 states have internal predecessors, (330), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:17:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 368 transitions. [2025-03-04 01:17:11,244 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 368 transitions. Word has length 131 [2025-03-04 01:17:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:11,244 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 368 transitions. [2025-03-04 01:17:11,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:17:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 368 transitions. [2025-03-04 01:17:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:17:11,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:11,245 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:11,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:17:11,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:11,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash 323638218, now seen corresponding path program 1 times [2025-03-04 01:17:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:11,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917506384] [2025-03-04 01:17:11,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:11,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:17:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:17:11,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:11,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:11,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917506384] [2025-03-04 01:17:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917506384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:11,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:11,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:17:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348850594] [2025-03-04 01:17:11,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:11,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:17:11,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:11,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:17:11,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:17:11,340 INFO L87 Difference]: Start difference. First operand 263 states and 368 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:11,577 INFO L93 Difference]: Finished difference Result 534 states and 744 transitions. [2025-03-04 01:17:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:17:11,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-04 01:17:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:11,579 INFO L225 Difference]: With dead ends: 534 [2025-03-04 01:17:11,579 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 01:17:11,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:17:11,580 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 117 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:11,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 601 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:17:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 01:17:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2025-03-04 01:17:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 240 states have (on average 1.3916666666666666) internal successors, (334), 241 states have internal predecessors, (334), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:17:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 376 transitions. [2025-03-04 01:17:11,612 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 376 transitions. Word has length 133 [2025-03-04 01:17:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:11,612 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 376 transitions. [2025-03-04 01:17:11,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 376 transitions. [2025-03-04 01:17:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:17:11,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:11,613 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:11,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:17:11,613 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:11,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash -681377044, now seen corresponding path program 1 times [2025-03-04 01:17:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:11,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468242781] [2025-03-04 01:17:11,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:11,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:17:11,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:17:11,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:11,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:11,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468242781] [2025-03-04 01:17:11,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468242781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:11,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:11,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:17:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846917004] [2025-03-04 01:17:11,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:11,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:17:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:11,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:17:11,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:17:11,704 INFO L87 Difference]: Start difference. First operand 271 states and 376 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:11,903 INFO L93 Difference]: Finished difference Result 535 states and 741 transitions. [2025-03-04 01:17:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:17:11,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-03-04 01:17:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:11,907 INFO L225 Difference]: With dead ends: 535 [2025-03-04 01:17:11,907 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 01:17:11,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:17:11,908 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 106 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:11,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 570 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:17:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 01:17:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2025-03-04 01:17:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 233 states have (on average 1.386266094420601) internal successors, (323), 234 states have internal predecessors, (323), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:17:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2025-03-04 01:17:11,945 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 134 [2025-03-04 01:17:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:11,945 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2025-03-04 01:17:11,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2025-03-04 01:17:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:17:11,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:11,946 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:11,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:17:11,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:11,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1448018640, now seen corresponding path program 1 times [2025-03-04 01:17:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:11,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336299652] [2025-03-04 01:17:11,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:11,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:17:11,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:17:11,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:11,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336299652] [2025-03-04 01:17:12,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336299652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:12,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:12,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:17:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575849462] [2025-03-04 01:17:12,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:12,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:17:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:12,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:17:12,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:17:12,113 INFO L87 Difference]: Start difference. First operand 264 states and 365 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:12,327 INFO L93 Difference]: Finished difference Result 398 states and 546 transitions. [2025-03-04 01:17:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:17:12,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-03-04 01:17:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:12,329 INFO L225 Difference]: With dead ends: 398 [2025-03-04 01:17:12,330 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 01:17:12,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:17:12,331 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 82 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:12,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 977 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:17:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 01:17:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 348. [2025-03-04 01:17:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 313 states have (on average 1.3674121405750799) internal successors, (428), 315 states have internal predecessors, (428), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:17:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 476 transitions. [2025-03-04 01:17:12,374 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 476 transitions. Word has length 134 [2025-03-04 01:17:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:12,377 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 476 transitions. [2025-03-04 01:17:12,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 476 transitions. [2025-03-04 01:17:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:17:12,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:12,378 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:12,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:17:12,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:12,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:12,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1683004528, now seen corresponding path program 1 times [2025-03-04 01:17:12,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457243960] [2025-03-04 01:17:12,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:12,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:17:12,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:17:12,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:12,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:13,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457243960] [2025-03-04 01:17:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457243960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:13,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:17:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621640545] [2025-03-04 01:17:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:17:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:13,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:17:13,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:17:13,192 INFO L87 Difference]: Start difference. First operand 348 states and 476 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:17:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:14,012 INFO L93 Difference]: Finished difference Result 813 states and 1119 transitions. [2025-03-04 01:17:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:17:14,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 135 [2025-03-04 01:17:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:14,016 INFO L225 Difference]: With dead ends: 813 [2025-03-04 01:17:14,016 INFO L226 Difference]: Without dead ends: 468 [2025-03-04 01:17:14,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:17:14,017 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1052 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:14,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1110 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:17:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-04 01:17:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 389. [2025-03-04 01:17:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 354 states have (on average 1.3785310734463276) internal successors, (488), 356 states have internal predecessors, (488), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:17:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 536 transitions. [2025-03-04 01:17:14,061 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 536 transitions. Word has length 135 [2025-03-04 01:17:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:14,063 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 536 transitions. [2025-03-04 01:17:14,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:17:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 536 transitions. [2025-03-04 01:17:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:17:14,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:14,064 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:14,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:17:14,064 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:14,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:14,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1081532714, now seen corresponding path program 1 times [2025-03-04 01:17:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670348538] [2025-03-04 01:17:14,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:14,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:17:14,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:17:14,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:14,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:14,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:14,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670348538] [2025-03-04 01:17:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670348538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:14,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:17:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475635808] [2025-03-04 01:17:14,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:14,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:17:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:14,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:17:14,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:17:14,145 INFO L87 Difference]: Start difference. First operand 389 states and 536 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:14,366 INFO L93 Difference]: Finished difference Result 1005 states and 1391 transitions. [2025-03-04 01:17:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:17:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-04 01:17:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:14,371 INFO L225 Difference]: With dead ends: 1005 [2025-03-04 01:17:14,371 INFO L226 Difference]: Without dead ends: 619 [2025-03-04 01:17:14,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:17:14,372 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 107 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:14,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 430 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:17:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-04 01:17:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 458. [2025-03-04 01:17:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 423 states have (on average 1.3711583924349882) internal successors, (580), 425 states have internal predecessors, (580), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:17:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 628 transitions. [2025-03-04 01:17:14,418 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 628 transitions. Word has length 136 [2025-03-04 01:17:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:14,418 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 628 transitions. [2025-03-04 01:17:14,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 628 transitions. [2025-03-04 01:17:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:17:14,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:14,419 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:17:14,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -247488507, now seen corresponding path program 1 times [2025-03-04 01:17:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:14,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376500314] [2025-03-04 01:17:14,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:14,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:14,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:17:14,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:17:14,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:14,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:15,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:15,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376500314] [2025-03-04 01:17:15,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376500314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:15,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:15,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:17:15,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577434968] [2025-03-04 01:17:15,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:15,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:17:15,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:15,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:17:15,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:17:15,129 INFO L87 Difference]: Start difference. First operand 458 states and 628 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:17:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:15,728 INFO L93 Difference]: Finished difference Result 949 states and 1300 transitions. [2025-03-04 01:17:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:17:15,729 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 136 [2025-03-04 01:17:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:15,730 INFO L225 Difference]: With dead ends: 949 [2025-03-04 01:17:15,730 INFO L226 Difference]: Without dead ends: 494 [2025-03-04 01:17:15,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:17:15,732 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 658 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:15,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 851 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:17:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-04 01:17:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 460. [2025-03-04 01:17:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 425 states have (on average 1.3694117647058823) internal successors, (582), 427 states have internal predecessors, (582), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:17:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 630 transitions. [2025-03-04 01:17:15,787 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 630 transitions. Word has length 136 [2025-03-04 01:17:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:15,787 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 630 transitions. [2025-03-04 01:17:15,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:17:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 630 transitions. [2025-03-04 01:17:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:17:15,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:15,788 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:15,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:17:15,788 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:15,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1553183581, now seen corresponding path program 1 times [2025-03-04 01:17:15,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:15,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635128255] [2025-03-04 01:17:15,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:15,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:15,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:17:15,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:17:15,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:15,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635128255] [2025-03-04 01:17:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635128255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:15,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:15,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:17:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120654389] [2025-03-04 01:17:15,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:15,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:17:15,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:15,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:17:15,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:17:15,873 INFO L87 Difference]: Start difference. First operand 460 states and 630 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:16,153 INFO L93 Difference]: Finished difference Result 1076 states and 1480 transitions. [2025-03-04 01:17:16,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:17:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-04 01:17:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:16,156 INFO L225 Difference]: With dead ends: 1076 [2025-03-04 01:17:16,156 INFO L226 Difference]: Without dead ends: 619 [2025-03-04 01:17:16,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:17:16,157 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 106 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:16,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 727 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:17:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-04 01:17:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 460. [2025-03-04 01:17:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 425 states have (on average 1.36) internal successors, (578), 427 states have internal predecessors, (578), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:17:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 626 transitions. [2025-03-04 01:17:16,207 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 626 transitions. Word has length 136 [2025-03-04 01:17:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:16,207 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 626 transitions. [2025-03-04 01:17:16,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:17:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 626 transitions. [2025-03-04 01:17:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:17:16,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:16,209 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:16,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:17:16,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1875550285, now seen corresponding path program 1 times [2025-03-04 01:17:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747767144] [2025-03-04 01:17:16,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:16,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:17:16,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:17:16,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:16,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:17:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:16,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747767144] [2025-03-04 01:17:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747767144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:16,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:16,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:17:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609287551] [2025-03-04 01:17:16,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:17:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:16,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:17:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:17:16,503 INFO L87 Difference]: Start difference. First operand 460 states and 626 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:17:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:16,879 INFO L93 Difference]: Finished difference Result 1156 states and 1583 transitions. [2025-03-04 01:17:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:17:16,879 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2025-03-04 01:17:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:16,881 INFO L225 Difference]: With dead ends: 1156 [2025-03-04 01:17:16,881 INFO L226 Difference]: Without dead ends: 699 [2025-03-04 01:17:16,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:17:16,883 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 364 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:16,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1478 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:17:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-04 01:17:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 591. [2025-03-04 01:17:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 556 states have (on average 1.3633093525179856) internal successors, (758), 558 states have internal predecessors, (758), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:17:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 806 transitions. [2025-03-04 01:17:16,944 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 806 transitions. Word has length 137 [2025-03-04 01:17:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:16,945 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 806 transitions. [2025-03-04 01:17:16,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:17:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 806 transitions. [2025-03-04 01:17:16,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:17:16,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:16,946 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:16,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:17:16,947 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:16,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash 68095822, now seen corresponding path program 1 times [2025-03-04 01:17:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:16,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145216905] [2025-03-04 01:17:16,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:16,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:16,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:17:17,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:17:17,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:17,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:17:17,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:17:17,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:17:17,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:17:17,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:17:17,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:17:17,114 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:17:17,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:17:17,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:17:17,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:17,255 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:17:17,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:17:17 BoogieIcfgContainer [2025-03-04 01:17:17,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:17:17,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:17:17,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:17:17,260 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:17:17,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:16:36" (3/4) ... [2025-03-04 01:17:17,262 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:17:17,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:17:17,263 INFO L158 Benchmark]: Toolchain (without parser) took 41196.52ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 112.8MB in the beginning and 117.0MB in the end (delta: -4.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2025-03-04 01:17:17,263 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:17:17,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.71ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 97.6MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:17:17,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.20ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 93.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:17:17,264 INFO L158 Benchmark]: Boogie Preprocessor took 53.98ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 90.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:17:17,265 INFO L158 Benchmark]: IcfgBuilder took 637.66ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 52.1MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:17:17,265 INFO L158 Benchmark]: TraceAbstraction took 40264.70ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 51.6MB in the beginning and 117.0MB in the end (delta: -65.4MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2025-03-04 01:17:17,266 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 117.0MB in the end (delta: 30.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:17:17,266 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.71ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 97.6MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.20ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 93.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.98ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 90.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 637.66ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 52.1MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40264.70ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 51.6MB in the beginning and 117.0MB in the end (delta: -65.4MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 117.0MB in the end (delta: 30.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 51, overapproximation of someUnaryFLOAToperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L22-L24] float float_Array_0[3] = { 1.75, 7.8, 1.1 }; [L25] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L26] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L27] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L28-L30] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L28-L30] signed long int signed_long_int_Array_0[3] = { 1230482582, 32, 5 }; [L31] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L32] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1]); [L33] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer = &(signed_long_int_Array_0[2]); [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L34-L36] signed short int signed_short_int_Array_0[5] = { 32, 10, 1000, 0, -5 }; [L37] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L38] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L39] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer = &(signed_short_int_Array_0[2]); [L40] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer = &(signed_short_int_Array_0[3]); [L41] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer = &(signed_short_int_Array_0[4]); [L42-L44] unsigned char unsigned_char_Array_0[1] = { 64 }; [L42-L44] unsigned char unsigned_char_Array_0[1] = { 64 }; [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=0, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L72] float_Array_0[0] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L73] EXPR float_Array_0[0] [L73] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L73] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L75] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L76] float_Array_0[2] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[2] [L77] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F [L77] EXPR float_Array_0[2] [L77] EXPR float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] EXPR (float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] CALL assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L77] RET assume_abort_if_not((float_Array_0[2] >= -922337.2036854776000e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854776000e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L78] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L79] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L79] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L79] RET assume_abort_if_not(signed_long_int_Array_0[0] >= 1073741823) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L80] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L80] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L80] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L81] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L82] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L82] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L82] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L83] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L83] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L83] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L84] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L85] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L86] EXPR signed_short_int_Array_0[1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L87] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L89] EXPR signed_short_int_Array_0[2] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 16383) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L90] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L91] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[3] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L92] EXPR signed_short_int_Array_0[3] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L92] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L92] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L93] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L95] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L109] RET updateVariables() [L110] CALL step() [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L49] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L49] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L49] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) = ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) [L50] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L50] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L50] COND TRUE (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L51] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L51] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L51] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L51] COND TRUE (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L52] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L52] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) [L59] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L59] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L59] signed long int stepLocal_1 = (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))); [L60] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L60] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L60] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L60] signed long int stepLocal_0 = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))); [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L61] COND FALSE !(stepLocal_1 != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L68] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L68] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) [L101] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L101] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) [L101] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L101] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L101] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)))) [L101] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer) [L101] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer) [L101] EXPR ((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) && ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) && ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L101-L102] return (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) + (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) >= (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))) ? (((((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))))) && ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer)) + ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) != (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) / (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)) - ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((((-256) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))))))))) ? (-256) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))))))))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer))))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] [L19] reach_error() VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:8}, isInitial=1, signed_long_int_Array_0={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={5:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={5:4}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer={5:8}, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={6:4}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var3_Pointer={6:6}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var4_Pointer={6:8}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.1s, OverallIterations: 17, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6693 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6691 mSDsluCounter, 18865 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16100 mSDsCounter, 513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14514 IncrementalHoareTripleChecker+Invalid, 15027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 513 mSolverCounterUnsat, 2765 mSDtfsCounter, 14514 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3931 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=16, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 1326 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 2504 NumberOfCodeBlocks, 2504 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2349 ConstructedInterpolants, 2 QuantifiedInterpolants, 23865 SizeOfPredicates, 21 NumberOfNonLiveVariables, 992 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 8370/8640 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-04 01:17:17,388 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-ap_file-39.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 b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:17:19,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:17:19,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:17:19,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:17:19,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:17:19,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:17:19,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:17:19,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:17:19,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:17:19,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:17:19,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:17:19,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:17:19,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:17:19,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:17:19,111 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:17:19,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:17:19,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:17:19,111 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:17:19,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:17:19,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:17:19,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:17:19,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:17:19,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:17:19,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:17:19,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:17:19,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:17:19,114 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 -> b745f2eefec39227a3dae672aed32affddda67824dced86b7d9f77df6468e472 [2025-03-04 01:17:19,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:17:19,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:17:19,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:17:19,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:17:19,351 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:17:19,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-04 01:17:20,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437e6d1bb/d53fc7c496aa47baa0b9038f0b26c94c/FLAGb7709fa6c [2025-03-04 01:17:20,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:17:20,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-04 01:17:20,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437e6d1bb/d53fc7c496aa47baa0b9038f0b26c94c/FLAGb7709fa6c [2025-03-04 01:17:20,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/437e6d1bb/d53fc7c496aa47baa0b9038f0b26c94c [2025-03-04 01:17:20,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:17:20,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:17:20,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:17:20,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:17:20,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:17:20,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:17:20" (1/1) ... [2025-03-04 01:17:20,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717be6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:20, skipping insertion in model container [2025-03-04 01:17:20,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:17:20" (1/1) ... [2025-03-04 01:17:20,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:17:20,898 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-ap_file-39.i[917,930] [2025-03-04 01:17:20,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:17:20,973 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:17:20,982 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-ap_file-39.i[917,930] [2025-03-04 01:17:21,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:17:21,028 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:17:21,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21 WrapperNode [2025-03-04 01:17:21,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:17:21,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:17:21,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:17:21,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:17:21,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,082 INFO L138 Inliner]: procedures = 36, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 595 [2025-03-04 01:17:21,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:17:21,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:17:21,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:17:21,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:17:21,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,132 INFO L175 MemorySlicer]: Split 160 memory accesses to 5 slices as follows [2, 32, 22, 97, 7]. 61 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 3, 3, 5, 1]. The 16 writes are split as follows [0, 3, 7, 5, 1]. [2025-03-04 01:17:21,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:17:21,173 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:17:21,173 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:17:21,173 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:17:21,174 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (1/1) ... [2025-03-04 01:17:21,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:17:21,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:17:21,207 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-04 01:17:21,209 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-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:17:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:17:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:17:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:17:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:17:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:17:21,355 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:17:21,357 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:17:22,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem112#1;havoc property_#t~mem105#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~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite130#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem122#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~ite174#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite171#1;havoc property_#t~mem168#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite153#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite152#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~ite167#1;havoc property_#t~mem159#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite158#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite166#1;havoc property_#t~mem160#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~ite165#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~mem170#1;havoc property_#t~mem169#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~short175#1; [2025-03-04 01:17:22,415 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2025-03-04 01:17:22,415 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:17:22,425 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:17:22,425 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:17:22,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:17:22 BoogieIcfgContainer [2025-03-04 01:17:22,427 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:17:22,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:17:22,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:17:22,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:17:22,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:17:20" (1/3) ... [2025-03-04 01:17:22,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc05fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:17:22, skipping insertion in model container [2025-03-04 01:17:22,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:21" (2/3) ... [2025-03-04 01:17:22,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc05fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:17:22, skipping insertion in model container [2025-03-04 01:17:22,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:17:22" (3/3) ... [2025-03-04 01:17:22,434 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-39.i [2025-03-04 01:17:22,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:17:22,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-39.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:17:22,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:17:22,489 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;@171b90a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:17:22,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:17:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:17:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:17:22,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:22,499 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:22,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:22,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:22,503 INFO L85 PathProgramCache]: Analyzing trace with hash 196742449, now seen corresponding path program 1 times [2025-03-04 01:17:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886068828] [2025-03-04 01:17:22,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:22,512 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-04 01:17:22,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:22,514 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-04 01:17:22,516 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-04 01:17:22,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:17:22,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:17:22,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:22,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:22,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:17:22,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-04 01:17:22,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:22,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:22,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886068828] [2025-03-04 01:17:22,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886068828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:22,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:22,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:17:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393192866] [2025-03-04 01:17:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:17:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:22,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:17:22,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:17:22,859 INFO L87 Difference]: Start difference. First operand has 113 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:17:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:22,876 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2025-03-04 01:17:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:17:22,877 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2025-03-04 01:17:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:22,881 INFO L225 Difference]: With dead ends: 220 [2025-03-04 01:17:22,882 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:17:22,884 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-04 01:17:22,885 INFO L435 NwaCegarLoop]: 162 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, 162 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-04 01:17:22,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:17:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 01:17:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:17:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2025-03-04 01:17:22,918 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 126 [2025-03-04 01:17:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:22,919 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2025-03-04 01:17:22,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:17:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2025-03-04 01:17:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:17:22,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:22,932 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:22,941 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-04 01:17:23,133 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-04 01:17:23,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:23,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:23,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2144167875, now seen corresponding path program 1 times [2025-03-04 01:17:23,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:23,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598312794] [2025-03-04 01:17:23,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:23,135 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-04 01:17:23,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:23,137 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-04 01:17:23,138 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-04 01:17:23,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:17:23,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:17:23,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:23,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:23,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:17:23,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-04 01:17:23,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:23,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:23,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598312794] [2025-03-04 01:17:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598312794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:17:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445663997] [2025-03-04 01:17:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:23,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:17:23,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:23,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:17:23,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:23,444 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:17:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:23,488 INFO L93 Difference]: Finished difference Result 219 states and 324 transitions. [2025-03-04 01:17:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:17:23,491 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), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2025-03-04 01:17:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:23,492 INFO L225 Difference]: With dead ends: 219 [2025-03-04 01:17:23,492 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:17:23,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 123 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-04 01:17:23,493 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 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-04 01:17:23,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:17:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 01:17:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:17:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2025-03-04 01:17:23,506 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 126 [2025-03-04 01:17:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2025-03-04 01:17:23,509 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), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:17:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2025-03-04 01:17:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:17:23,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:23,510 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:23,519 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 (3)] Ended with exit code 0 [2025-03-04 01:17:23,711 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-04 01:17:23,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:23,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1013381250, now seen corresponding path program 1 times [2025-03-04 01:17:23,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:23,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626862075] [2025-03-04 01:17:23,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:23,713 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-04 01:17:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:23,715 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-04 01:17:23,716 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-04 01:17:23,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:17:24,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:17:24,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:24,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:24,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:17:24,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:25,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:17:26,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:17:26,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:17:27,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2025-03-04 01:17:28,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:17:28,227 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 6 case distinctions, treesize of input 100 treesize of output 52 [2025-03-04 01:17:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 4 proven. 232 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-04 01:17:28,376 INFO L312 TraceCheckSpWp]: Computing backward predicates...