./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-4.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 ebe3d6e9d03e6e5cf83180cae6564bdb73d3d5ae307bc763d1d081898bce00b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:25:32,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:25:32,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:25:32,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:25:32,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:25:32,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:25:32,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:25:32,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:25:32,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:25:32,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:25:32,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:25:32,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:25:32,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:25:32,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:25:32,763 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:25:32,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:25:32,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:25:32,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:25:32,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:25:32,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:25:32,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:25:32,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:25:32,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:25:32,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:25:32,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:25:32,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:25:32,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:25:32,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:25:32,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:25:32,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:25:32,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:25:32,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:25:32,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:25:32,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:25:32,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:25:32,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:25:32,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:25:32,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:25:32,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:25:32,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:25:32,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:25:32,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:25:32,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ebe3d6e9d03e6e5cf83180cae6564bdb73d3d5ae307bc763d1d081898bce00b0 [2024-11-10 09:25:33,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:25:33,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:25:33,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:25:33,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:25:33,088 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:25:33,089 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-4.i [2024-11-10 09:25:34,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:25:34,837 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:25:34,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-4.i [2024-11-10 09:25:34,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d30f25b/bb2e0048b62640a9a2103f79c7eccaa3/FLAG8e0cda4b5 [2024-11-10 09:25:35,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d30f25b/bb2e0048b62640a9a2103f79c7eccaa3 [2024-11-10 09:25:35,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:25:35,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:25:35,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:25:35,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:25:35,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:25:35,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca33f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35, skipping insertion in model container [2024-11-10 09:25:35,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:25:35,402 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-4.i[916,929] [2024-11-10 09:25:35,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:25:35,482 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:25:35,495 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-4.i[916,929] [2024-11-10 09:25:35,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:25:35,575 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:25:35,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35 WrapperNode [2024-11-10 09:25:35,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:25:35,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:25:35,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:25:35,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:25:35,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,640 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 508 [2024-11-10 09:25:35,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:25:35,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:25:35,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:25:35,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:25:35,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,690 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 38, 11, 55, 12, 12]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 4, 1, 4, 2, 2]. The 15 writes are split as follows [0, 4, 1, 5, 3, 2]. [2024-11-10 09:25:35,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:25:35,723 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:25:35,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:25:35,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:25:35,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (1/1) ... [2024-11-10 09:25:35,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:25:35,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:25:35,773 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) [2024-11-10 09:25:35,776 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 [2024-11-10 09:25:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:25:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-10 09:25:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-10 09:25:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-10 09:25:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-10 09:25:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-10 09:25:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-10 09:25:35,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 09:25:35,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 09:25:35,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 09:25:35,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 09:25:35,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 09:25:35,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 09:25:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-10 09:25:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-10 09:25:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-10 09:25:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-10 09:25:35,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-10 09:25:35,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-10 09:25:35,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 09:25:35,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 09:25:35,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 09:25:35,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 09:25:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 09:25:35,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 09:25:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-10 09:25:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-10 09:25:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-10 09:25:35,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-10 09:25:35,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-10 09:25:35,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-10 09:25:35,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:25:35,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:25:35,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:25:35,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 09:25:35,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 09:25:35,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 09:25:35,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 09:25:35,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 09:25:35,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:25:35,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:25:36,020 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:25:36,022 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:25:36,587 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite102#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite119#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~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite137#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2024-11-10 09:25:36,643 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-11-10 09:25:36,643 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:25:36,660 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:25:36,660 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:25:36,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:25:36 BoogieIcfgContainer [2024-11-10 09:25:36,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:25:36,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:25:36,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:25:36,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:25:36,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:25:35" (1/3) ... [2024-11-10 09:25:36,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60dd7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:25:36, skipping insertion in model container [2024-11-10 09:25:36,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:35" (2/3) ... [2024-11-10 09:25:36,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60dd7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:25:36, skipping insertion in model container [2024-11-10 09:25:36,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:25:36" (3/3) ... [2024-11-10 09:25:36,672 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-4.i [2024-11-10 09:25:36,689 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:25:36,690 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:25:36,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:25:36,771 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;@4471c891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:25:36,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:25:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 96 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:25:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 09:25:36,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:36,795 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:36,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:36,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:36,803 INFO L85 PathProgramCache]: Analyzing trace with hash -189570266, now seen corresponding path program 1 times [2024-11-10 09:25:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:36,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878049034] [2024-11-10 09:25:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:37,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878049034] [2024-11-10 09:25:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878049034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:37,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:25:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292673561] [2024-11-10 09:25:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:37,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:25:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:37,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:25:37,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:25:37,361 INFO L87 Difference]: Start difference. First operand has 113 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 96 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:37,391 INFO L93 Difference]: Finished difference Result 218 states and 336 transitions. [2024-11-10 09:25:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:25:37,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-10 09:25:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:37,404 INFO L225 Difference]: With dead ends: 218 [2024-11-10 09:25:37,404 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 09:25:37,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:25:37,412 INFO L432 NwaCegarLoop]: 156 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, 156 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 [2024-11-10 09:25:37,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:25:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 09:25:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-10 09:25:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:25:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-10 09:25:37,466 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 132 [2024-11-10 09:25:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:37,466 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-10 09:25:37,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-10 09:25:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 09:25:37,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:37,473 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:37,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:25:37,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:37,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1306522245, now seen corresponding path program 1 times [2024-11-10 09:25:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:37,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67814455] [2024-11-10 09:25:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67814455] [2024-11-10 09:25:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67814455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:37,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:37,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:25:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436941886] [2024-11-10 09:25:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:37,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:25:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:25:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:25:37,965 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:38,028 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-10 09:25:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:25:38,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-10 09:25:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:38,031 INFO L225 Difference]: With dead ends: 216 [2024-11-10 09:25:38,032 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 09:25:38,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:25:38,035 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:38,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:25:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 09:25:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-10 09:25:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:25:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-10 09:25:38,052 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 132 [2024-11-10 09:25:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:38,054 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-10 09:25:38,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-10 09:25:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 09:25:38,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:38,059 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:38,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:25:38,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:38,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1277893094, now seen corresponding path program 1 times [2024-11-10 09:25:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884569627] [2024-11-10 09:25:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:38,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:38,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884569627] [2024-11-10 09:25:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884569627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:38,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:38,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:25:38,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444768224] [2024-11-10 09:25:38,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:38,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:25:38,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:25:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:25:38,981 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:39,206 INFO L93 Difference]: Finished difference Result 298 states and 428 transitions. [2024-11-10 09:25:39,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:25:39,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-10 09:25:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:39,208 INFO L225 Difference]: With dead ends: 298 [2024-11-10 09:25:39,209 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 09:25:39,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:25:39,210 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 113 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:39,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 689 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:25:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 09:25:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2024-11-10 09:25:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 160 states have (on average 1.38125) internal successors, (221), 161 states have internal predecessors, (221), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:25:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 269 transitions. [2024-11-10 09:25:39,227 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 269 transitions. Word has length 132 [2024-11-10 09:25:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:39,227 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 269 transitions. [2024-11-10 09:25:39,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 269 transitions. [2024-11-10 09:25:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 09:25:39,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:39,229 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:39,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:25:39,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:39,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1148810375, now seen corresponding path program 1 times [2024-11-10 09:25:39,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:39,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721874214] [2024-11-10 09:25:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:39,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:39,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721874214] [2024-11-10 09:25:39,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721874214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:39,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:39,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:25:39,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373309715] [2024-11-10 09:25:39,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:39,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:25:39,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:39,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:25:39,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:25:39,461 INFO L87 Difference]: Start difference. First operand 187 states and 269 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:39,489 INFO L93 Difference]: Finished difference Result 375 states and 541 transitions. [2024-11-10 09:25:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:25:39,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-10 09:25:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:39,493 INFO L225 Difference]: With dead ends: 375 [2024-11-10 09:25:39,495 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 09:25:39,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:25:39,497 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:39,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:25:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 09:25:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-10 09:25:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 164 states have (on average 1.3719512195121952) internal successors, (225), 165 states have internal predecessors, (225), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:25:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2024-11-10 09:25:39,525 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 132 [2024-11-10 09:25:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:39,526 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2024-11-10 09:25:39,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2024-11-10 09:25:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 09:25:39,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:39,531 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:39,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:25:39,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:39,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1085804193, now seen corresponding path program 1 times [2024-11-10 09:25:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:39,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247475764] [2024-11-10 09:25:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247475764] [2024-11-10 09:25:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247475764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:39,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:25:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989883386] [2024-11-10 09:25:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:39,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:25:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:39,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:25:39,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:25:39,797 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:39,834 INFO L93 Difference]: Finished difference Result 385 states and 551 transitions. [2024-11-10 09:25:39,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:25:39,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-11-10 09:25:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:39,839 INFO L225 Difference]: With dead ends: 385 [2024-11-10 09:25:39,840 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 09:25:39,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:25:39,842 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:39,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 598 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:25:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 09:25:39,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2024-11-10 09:25:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 166 states have (on average 1.3674698795180722) internal successors, (227), 167 states have internal predecessors, (227), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:25:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2024-11-10 09:25:39,869 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 134 [2024-11-10 09:25:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:39,870 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2024-11-10 09:25:39,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2024-11-10 09:25:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:25:39,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:39,876 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:39,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:25:39,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:39,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash -86476268, now seen corresponding path program 1 times [2024-11-10 09:25:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812109377] [2024-11-10 09:25:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812109377] [2024-11-10 09:25:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812109377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:25:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596539709] [2024-11-10 09:25:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:41,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:25:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:41,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:25:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:25:41,471 INFO L87 Difference]: Start difference. First operand 193 states and 275 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:42,220 INFO L93 Difference]: Finished difference Result 601 states and 858 transitions. [2024-11-10 09:25:42,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:25:42,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-10 09:25:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:42,223 INFO L225 Difference]: With dead ends: 601 [2024-11-10 09:25:42,223 INFO L226 Difference]: Without dead ends: 411 [2024-11-10 09:25:42,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:25:42,225 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 389 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:42,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 758 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:25:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-10 09:25:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 215. [2024-11-10 09:25:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 188 states have (on average 1.372340425531915) internal successors, (258), 189 states have internal predecessors, (258), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 09:25:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 306 transitions. [2024-11-10 09:25:42,255 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 306 transitions. Word has length 135 [2024-11-10 09:25:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:42,255 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 306 transitions. [2024-11-10 09:25:42,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 306 transitions. [2024-11-10 09:25:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:25:42,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:42,258 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:42,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:25:42,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:42,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1266833429, now seen corresponding path program 1 times [2024-11-10 09:25:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567324878] [2024-11-10 09:25:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:43,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:43,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567324878] [2024-11-10 09:25:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567324878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:43,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:43,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:25:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309053303] [2024-11-10 09:25:43,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:43,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:25:43,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:43,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:25:43,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:25:43,246 INFO L87 Difference]: Start difference. First operand 215 states and 306 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:43,592 INFO L93 Difference]: Finished difference Result 480 states and 683 transitions. [2024-11-10 09:25:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:25:43,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-10 09:25:43,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:43,596 INFO L225 Difference]: With dead ends: 480 [2024-11-10 09:25:43,596 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 09:25:43,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:25:43,597 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 306 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:43,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 695 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:25:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 09:25:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 129. [2024-11-10 09:25:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:25:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2024-11-10 09:25:43,617 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 135 [2024-11-10 09:25:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:43,619 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2024-11-10 09:25:43,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2024-11-10 09:25:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:25:43,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:43,620 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:43,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:25:43,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:43,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash -991590307, now seen corresponding path program 1 times [2024-11-10 09:25:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829835944] [2024-11-10 09:25:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:44,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:44,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829835944] [2024-11-10 09:25:44,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829835944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:44,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:25:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237758040] [2024-11-10 09:25:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:44,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:25:44,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:44,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:25:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:25:44,691 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:45,413 INFO L93 Difference]: Finished difference Result 385 states and 542 transitions. [2024-11-10 09:25:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:25:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:25:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:45,416 INFO L225 Difference]: With dead ends: 385 [2024-11-10 09:25:45,417 INFO L226 Difference]: Without dead ends: 259 [2024-11-10 09:25:45,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:25:45,419 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 394 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:45,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 805 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:25:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-10 09:25:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 134. [2024-11-10 09:25:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 09:25:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 188 transitions. [2024-11-10 09:25:45,445 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 188 transitions. Word has length 136 [2024-11-10 09:25:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:45,446 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 188 transitions. [2024-11-10 09:25:45,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 188 transitions. [2024-11-10 09:25:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:25:45,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:45,448 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:45,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:25:45,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:45,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1502124484, now seen corresponding path program 1 times [2024-11-10 09:25:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457623815] [2024-11-10 09:25:45,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:46,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:46,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457623815] [2024-11-10 09:25:46,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457623815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:46,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:46,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:25:46,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598720546] [2024-11-10 09:25:46,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:46,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:25:46,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:46,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:25:46,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:25:46,352 INFO L87 Difference]: Start difference. First operand 134 states and 188 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:46,707 INFO L93 Difference]: Finished difference Result 336 states and 471 transitions. [2024-11-10 09:25:46,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:25:46,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-10 09:25:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:46,709 INFO L225 Difference]: With dead ends: 336 [2024-11-10 09:25:46,710 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 09:25:46,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:25:46,711 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 91 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:46,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 604 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:25:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 09:25:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2024-11-10 09:25:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 175 states have internal predecessors, (237), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:25:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 279 transitions. [2024-11-10 09:25:46,738 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 279 transitions. Word has length 136 [2024-11-10 09:25:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:46,739 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 279 transitions. [2024-11-10 09:25:46,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 279 transitions. [2024-11-10 09:25:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:25:46,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:46,741 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:25:46,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:46,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2143080642, now seen corresponding path program 1 times [2024-11-10 09:25:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594620868] [2024-11-10 09:25:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594620868] [2024-11-10 09:25:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594620868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:47,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:47,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:25:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63077637] [2024-11-10 09:25:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:47,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:25:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:25:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:25:47,454 INFO L87 Difference]: Start difference. First operand 199 states and 279 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:47,904 INFO L93 Difference]: Finished difference Result 471 states and 657 transitions. [2024-11-10 09:25:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:25:47,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2024-11-10 09:25:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:47,908 INFO L225 Difference]: With dead ends: 471 [2024-11-10 09:25:47,908 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 09:25:47,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:25:47,909 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 49 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:47,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 577 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:25:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 09:25:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 232. [2024-11-10 09:25:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 207 states have (on average 1.357487922705314) internal successors, (281), 208 states have internal predecessors, (281), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:25:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2024-11-10 09:25:47,941 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 136 [2024-11-10 09:25:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:47,941 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2024-11-10 09:25:47,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:25:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2024-11-10 09:25:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:25:47,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:47,943 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:47,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:25:47,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:47,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1398232638, now seen corresponding path program 1 times [2024-11-10 09:25:47,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:47,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129656127] [2024-11-10 09:25:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:47,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129656127] [2024-11-10 09:25:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129656127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:49,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:49,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 09:25:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063541460] [2024-11-10 09:25:49,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:49,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 09:25:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 09:25:49,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:25:49,655 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:50,841 INFO L93 Difference]: Finished difference Result 610 states and 846 transitions. [2024-11-10 09:25:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:25:50,841 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:25:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:50,844 INFO L225 Difference]: With dead ends: 610 [2024-11-10 09:25:50,844 INFO L226 Difference]: Without dead ends: 381 [2024-11-10 09:25:50,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:25:50,846 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 518 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:50,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1451 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:25:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-10 09:25:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 261. [2024-11-10 09:25:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 236 states have (on average 1.3305084745762712) internal successors, (314), 237 states have internal predecessors, (314), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:25:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 356 transitions. [2024-11-10 09:25:50,882 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 356 transitions. Word has length 136 [2024-11-10 09:25:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:50,885 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 356 transitions. [2024-11-10 09:25:50,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 356 transitions. [2024-11-10 09:25:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:25:50,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:50,887 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:50,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:25:50,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:50,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1269149919, now seen corresponding path program 1 times [2024-11-10 09:25:50,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:50,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580208345] [2024-11-10 09:25:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:50,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:52,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:52,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580208345] [2024-11-10 09:25:52,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580208345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:52,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:52,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 09:25:52,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203193040] [2024-11-10 09:25:52,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:52,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 09:25:52,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:52,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 09:25:52,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:25:52,558 INFO L87 Difference]: Start difference. First operand 261 states and 356 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:53,648 INFO L93 Difference]: Finished difference Result 723 states and 993 transitions. [2024-11-10 09:25:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 09:25:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:25:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:53,653 INFO L225 Difference]: With dead ends: 723 [2024-11-10 09:25:53,653 INFO L226 Difference]: Without dead ends: 465 [2024-11-10 09:25:53,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-11-10 09:25:53,655 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 755 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:53,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 844 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:25:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-10 09:25:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 264. [2024-11-10 09:25:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 239 states have (on average 1.3221757322175731) internal successors, (316), 240 states have internal predecessors, (316), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:25:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 358 transitions. [2024-11-10 09:25:53,697 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 358 transitions. Word has length 136 [2024-11-10 09:25:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:53,698 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 358 transitions. [2024-11-10 09:25:53,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:53,698 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 358 transitions. [2024-11-10 09:25:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:25:53,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:53,700 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:53,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:25:53,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:53,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1367212831, now seen corresponding path program 1 times [2024-11-10 09:25:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:53,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505121205] [2024-11-10 09:25:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:54,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505121205] [2024-11-10 09:25:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505121205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:54,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:54,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:25:54,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745572561] [2024-11-10 09:25:54,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:54,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:25:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:25:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:25:54,967 INFO L87 Difference]: Start difference. First operand 264 states and 358 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:55,798 INFO L93 Difference]: Finished difference Result 693 states and 951 transitions. [2024-11-10 09:25:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:25:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:25:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:55,801 INFO L225 Difference]: With dead ends: 693 [2024-11-10 09:25:55,801 INFO L226 Difference]: Without dead ends: 430 [2024-11-10 09:25:55,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:25:55,804 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 469 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:55,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 886 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:25:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-10 09:25:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 265. [2024-11-10 09:25:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 240 states have (on average 1.3166666666666667) internal successors, (316), 241 states have internal predecessors, (316), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:25:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 358 transitions. [2024-11-10 09:25:55,845 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 358 transitions. Word has length 136 [2024-11-10 09:25:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 358 transitions. [2024-11-10 09:25:55,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 358 transitions. [2024-11-10 09:25:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:25:55,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:55,849 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:55,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:25:55,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:55,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:55,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1238130112, now seen corresponding path program 1 times [2024-11-10 09:25:55,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:55,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714844087] [2024-11-10 09:25:55,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:55,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:25:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:25:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:25:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:25:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:25:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:25:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:25:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:25:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:25:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:25:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:25:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:25:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:25:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:25:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:25:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:25:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:25:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:25:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714844087] [2024-11-10 09:25:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714844087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:25:57,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:25:57,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 09:25:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908437036] [2024-11-10 09:25:57,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:25:57,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 09:25:57,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:25:57,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 09:25:57,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:25:57,303 INFO L87 Difference]: Start difference. First operand 265 states and 358 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:25:58,356 INFO L93 Difference]: Finished difference Result 647 states and 882 transitions. [2024-11-10 09:25:58,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 09:25:58,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:25:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:25:58,359 INFO L225 Difference]: With dead ends: 647 [2024-11-10 09:25:58,359 INFO L226 Difference]: Without dead ends: 385 [2024-11-10 09:25:58,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:25:58,360 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 243 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:25:58,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1262 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:25:58,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-10 09:25:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 265. [2024-11-10 09:25:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 240 states have (on average 1.3166666666666667) internal successors, (316), 241 states have internal predecessors, (316), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:25:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 358 transitions. [2024-11-10 09:25:58,399 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 358 transitions. Word has length 136 [2024-11-10 09:25:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:25:58,400 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 358 transitions. [2024-11-10 09:25:58,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:25:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 358 transitions. [2024-11-10 09:25:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:25:58,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:25:58,402 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:25:58,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:25:58,402 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:25:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:25:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2099745862, now seen corresponding path program 1 times [2024-11-10 09:25:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:25:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008295261] [2024-11-10 09:25:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:25:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:25:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:00,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008295261] [2024-11-10 09:26:00,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008295261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:00,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:00,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 09:26:00,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302509583] [2024-11-10 09:26:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:00,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:26:00,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:26:00,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:26:00,597 INFO L87 Difference]: Start difference. First operand 265 states and 358 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:02,379 INFO L93 Difference]: Finished difference Result 742 states and 1016 transitions. [2024-11-10 09:26:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:26:02,380 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:26:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:02,382 INFO L225 Difference]: With dead ends: 742 [2024-11-10 09:26:02,382 INFO L226 Difference]: Without dead ends: 480 [2024-11-10 09:26:02,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:26:02,384 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 598 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:02,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1794 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 09:26:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-10 09:26:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 304. [2024-11-10 09:26:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 279 states have (on average 1.3297491039426523) internal successors, (371), 280 states have internal predecessors, (371), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 413 transitions. [2024-11-10 09:26:02,423 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 413 transitions. Word has length 136 [2024-11-10 09:26:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:02,423 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 413 transitions. [2024-11-10 09:26:02,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 413 transitions. [2024-11-10 09:26:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:26:02,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:02,425 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:02,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:26:02,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:02,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:02,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1970663143, now seen corresponding path program 1 times [2024-11-10 09:26:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:02,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137921243] [2024-11-10 09:26:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:02,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:03,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:03,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137921243] [2024-11-10 09:26:03,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137921243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:03,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:03,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:26:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550337252] [2024-11-10 09:26:03,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:03,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:26:03,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:26:03,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:26:03,608 INFO L87 Difference]: Start difference. First operand 304 states and 413 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:04,211 INFO L93 Difference]: Finished difference Result 734 states and 1002 transitions. [2024-11-10 09:26:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:26:04,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:26:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:04,214 INFO L225 Difference]: With dead ends: 734 [2024-11-10 09:26:04,214 INFO L226 Difference]: Without dead ends: 433 [2024-11-10 09:26:04,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:26:04,216 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 628 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:04,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 667 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:26:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-10 09:26:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 304. [2024-11-10 09:26:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 279 states have (on average 1.3225806451612903) internal successors, (369), 280 states have internal predecessors, (369), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 411 transitions. [2024-11-10 09:26:04,255 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 411 transitions. Word has length 136 [2024-11-10 09:26:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:04,256 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 411 transitions. [2024-11-10 09:26:04,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 411 transitions. [2024-11-10 09:26:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:26:04,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:04,257 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:04,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:26:04,258 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1354897858, now seen corresponding path program 1 times [2024-11-10 09:26:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197972813] [2024-11-10 09:26:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:05,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:05,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197972813] [2024-11-10 09:26:05,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197972813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:05,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:05,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:26:05,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220951939] [2024-11-10 09:26:05,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:05,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:26:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:05,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:26:05,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:26:05,344 INFO L87 Difference]: Start difference. First operand 304 states and 411 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-10 09:26:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:06,418 INFO L93 Difference]: Finished difference Result 639 states and 861 transitions. [2024-11-10 09:26:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:26:06,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2024-11-10 09:26:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:06,421 INFO L225 Difference]: With dead ends: 639 [2024-11-10 09:26:06,421 INFO L226 Difference]: Without dead ends: 338 [2024-11-10 09:26:06,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:26:06,424 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 269 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:06,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 768 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:26:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-10 09:26:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 297. [2024-11-10 09:26:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 272 states have (on average 1.3014705882352942) internal successors, (354), 273 states have internal predecessors, (354), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 396 transitions. [2024-11-10 09:26:06,470 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 396 transitions. Word has length 136 [2024-11-10 09:26:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:06,470 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 396 transitions. [2024-11-10 09:26:06,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-10 09:26:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 396 transitions. [2024-11-10 09:26:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:26:06,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:06,472 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:06,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:26:06,473 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:06,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:06,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2068726055, now seen corresponding path program 1 times [2024-11-10 09:26:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:06,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031578360] [2024-11-10 09:26:06,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:06,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:07,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:07,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031578360] [2024-11-10 09:26:07,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031578360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:26:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951216417] [2024-11-10 09:26:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:07,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:26:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:07,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:26:07,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:26:07,701 INFO L87 Difference]: Start difference. First operand 297 states and 396 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:08,462 INFO L93 Difference]: Finished difference Result 748 states and 1013 transitions. [2024-11-10 09:26:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:26:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:26:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:08,466 INFO L225 Difference]: With dead ends: 748 [2024-11-10 09:26:08,466 INFO L226 Difference]: Without dead ends: 454 [2024-11-10 09:26:08,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:26:08,468 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 340 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:08,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 841 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:26:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-10 09:26:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 297. [2024-11-10 09:26:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 272 states have (on average 1.2941176470588236) internal successors, (352), 273 states have internal predecessors, (352), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 394 transitions. [2024-11-10 09:26:08,513 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 394 transitions. Word has length 136 [2024-11-10 09:26:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 394 transitions. [2024-11-10 09:26:08,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 394 transitions. [2024-11-10 09:26:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 09:26:08,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:08,517 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 09:26:08,517 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:08,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:08,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1939643336, now seen corresponding path program 1 times [2024-11-10 09:26:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009747512] [2024-11-10 09:26:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:09,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009747512] [2024-11-10 09:26:09,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009747512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:09,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:09,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 09:26:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284135817] [2024-11-10 09:26:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:09,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 09:26:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 09:26:09,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:26:09,828 INFO L87 Difference]: Start difference. First operand 297 states and 394 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:10,840 INFO L93 Difference]: Finished difference Result 703 states and 945 transitions. [2024-11-10 09:26:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:26:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-10 09:26:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:10,843 INFO L225 Difference]: With dead ends: 703 [2024-11-10 09:26:10,843 INFO L226 Difference]: Without dead ends: 409 [2024-11-10 09:26:10,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:26:10,844 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 306 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:10,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1740 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:26:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-10 09:26:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 289. [2024-11-10 09:26:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 264 states have (on average 1.2992424242424243) internal successors, (343), 265 states have internal predecessors, (343), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 385 transitions. [2024-11-10 09:26:10,893 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 385 transitions. Word has length 136 [2024-11-10 09:26:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:10,893 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 385 transitions. [2024-11-10 09:26:10,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 385 transitions. [2024-11-10 09:26:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 09:26:10,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:10,895 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:10,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 09:26:10,895 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:10,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 58925236, now seen corresponding path program 1 times [2024-11-10 09:26:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:10,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123196673] [2024-11-10 09:26:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:11,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:11,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123196673] [2024-11-10 09:26:11,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123196673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:11,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:11,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:26:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588493233] [2024-11-10 09:26:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:11,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:26:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:26:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:26:11,423 INFO L87 Difference]: Start difference. First operand 289 states and 385 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:11,769 INFO L93 Difference]: Finished difference Result 673 states and 894 transitions. [2024-11-10 09:26:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:26:11,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2024-11-10 09:26:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:11,771 INFO L225 Difference]: With dead ends: 673 [2024-11-10 09:26:11,771 INFO L226 Difference]: Without dead ends: 387 [2024-11-10 09:26:11,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:26:11,772 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 297 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:11,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 942 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:26:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-10 09:26:11,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 305. [2024-11-10 09:26:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 280 states have (on average 1.2964285714285715) internal successors, (363), 281 states have internal predecessors, (363), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2024-11-10 09:26:11,818 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 405 transitions. Word has length 137 [2024-11-10 09:26:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:11,819 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 405 transitions. [2024-11-10 09:26:11,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 405 transitions. [2024-11-10 09:26:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:26:11,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:11,820 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:11,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:26:11,820 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:11,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -439000393, now seen corresponding path program 1 times [2024-11-10 09:26:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060610193] [2024-11-10 09:26:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:12,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060610193] [2024-11-10 09:26:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060610193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:26:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932943998] [2024-11-10 09:26:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:26:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:26:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:26:12,309 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:12,785 INFO L93 Difference]: Finished difference Result 739 states and 980 transitions. [2024-11-10 09:26:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:26:12,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-10 09:26:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:12,789 INFO L225 Difference]: With dead ends: 739 [2024-11-10 09:26:12,789 INFO L226 Difference]: Without dead ends: 437 [2024-11-10 09:26:12,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:26:12,791 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 113 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:12,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1632 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:26:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-10 09:26:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 318. [2024-11-10 09:26:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 293 states have (on average 1.3071672354948805) internal successors, (383), 294 states have internal predecessors, (383), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 425 transitions. [2024-11-10 09:26:12,841 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 425 transitions. Word has length 139 [2024-11-10 09:26:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:12,842 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 425 transitions. [2024-11-10 09:26:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 425 transitions. [2024-11-10 09:26:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:26:12,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:12,843 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:12,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 09:26:12,844 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:12,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1912794969, now seen corresponding path program 1 times [2024-11-10 09:26:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719022797] [2024-11-10 09:26:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719022797] [2024-11-10 09:26:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719022797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:13,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:13,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:26:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101295704] [2024-11-10 09:26:13,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:13,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:26:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:26:13,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:26:13,366 INFO L87 Difference]: Start difference. First operand 318 states and 425 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:13,632 INFO L93 Difference]: Finished difference Result 372 states and 500 transitions. [2024-11-10 09:26:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:26:13,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-10 09:26:13,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:13,635 INFO L225 Difference]: With dead ends: 372 [2024-11-10 09:26:13,635 INFO L226 Difference]: Without dead ends: 369 [2024-11-10 09:26:13,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:26:13,636 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 188 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:13,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 896 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:26:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-10 09:26:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 324. [2024-11-10 09:26:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 299 states have (on average 1.3010033444816054) internal successors, (389), 300 states have internal predecessors, (389), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 431 transitions. [2024-11-10 09:26:13,678 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 431 transitions. Word has length 139 [2024-11-10 09:26:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:13,679 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 431 transitions. [2024-11-10 09:26:13,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 431 transitions. [2024-11-10 09:26:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:26:13,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:13,680 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:13,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 09:26:13,680 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:13,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1884165818, now seen corresponding path program 1 times [2024-11-10 09:26:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381232348] [2024-11-10 09:26:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381232348] [2024-11-10 09:26:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381232348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:26:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239048647] [2024-11-10 09:26:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:26:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:14,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:26:14,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:26:14,657 INFO L87 Difference]: Start difference. First operand 324 states and 431 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:15,155 INFO L93 Difference]: Finished difference Result 928 states and 1231 transitions. [2024-11-10 09:26:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:26:15,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-10 09:26:15,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:15,157 INFO L225 Difference]: With dead ends: 928 [2024-11-10 09:26:15,157 INFO L226 Difference]: Without dead ends: 607 [2024-11-10 09:26:15,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:26:15,158 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 257 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:15,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 992 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:26:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-10 09:26:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 495. [2024-11-10 09:26:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 470 states have (on average 1.2872340425531914) internal successors, (605), 471 states have internal predecessors, (605), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 647 transitions. [2024-11-10 09:26:15,213 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 647 transitions. Word has length 139 [2024-11-10 09:26:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:15,213 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 647 transitions. [2024-11-10 09:26:15,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 647 transitions. [2024-11-10 09:26:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:26:15,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:15,215 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:15,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 09:26:15,215 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:15,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:15,216 INFO L85 PathProgramCache]: Analyzing trace with hash 553284568, now seen corresponding path program 1 times [2024-11-10 09:26:15,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:15,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792893470] [2024-11-10 09:26:15,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:15,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:16,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:16,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792893470] [2024-11-10 09:26:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792893470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:16,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:16,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 09:26:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167417540] [2024-11-10 09:26:16,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:16,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 09:26:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:16,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 09:26:16,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:26:16,212 INFO L87 Difference]: Start difference. First operand 495 states and 647 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:17,073 INFO L93 Difference]: Finished difference Result 1196 states and 1544 transitions. [2024-11-10 09:26:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 09:26:17,074 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-10 09:26:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:17,077 INFO L225 Difference]: With dead ends: 1196 [2024-11-10 09:26:17,077 INFO L226 Difference]: Without dead ends: 704 [2024-11-10 09:26:17,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:26:17,079 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 210 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:17,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1699 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:26:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-10 09:26:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 495. [2024-11-10 09:26:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 470 states have (on average 1.2872340425531914) internal successors, (605), 471 states have internal predecessors, (605), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 647 transitions. [2024-11-10 09:26:17,139 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 647 transitions. Word has length 139 [2024-11-10 09:26:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:17,139 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 647 transitions. [2024-11-10 09:26:17,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 647 transitions. [2024-11-10 09:26:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:26:17,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:17,141 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:17,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 09:26:17,141 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:17,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash 42750391, now seen corresponding path program 1 times [2024-11-10 09:26:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87507244] [2024-11-10 09:26:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:17,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:17,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87507244] [2024-11-10 09:26:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87507244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:17,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:26:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886423585] [2024-11-10 09:26:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:17,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:26:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:26:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:26:17,491 INFO L87 Difference]: Start difference. First operand 495 states and 647 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:17,778 INFO L93 Difference]: Finished difference Result 1112 states and 1442 transitions. [2024-11-10 09:26:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:26:17,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-10 09:26:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:17,781 INFO L225 Difference]: With dead ends: 1112 [2024-11-10 09:26:17,781 INFO L226 Difference]: Without dead ends: 620 [2024-11-10 09:26:17,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:26:17,783 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 102 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:17,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 736 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:26:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-10 09:26:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 495. [2024-11-10 09:26:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 470 states have (on average 1.274468085106383) internal successors, (599), 471 states have internal predecessors, (599), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 641 transitions. [2024-11-10 09:26:17,828 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 641 transitions. Word has length 139 [2024-11-10 09:26:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:17,829 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 641 transitions. [2024-11-10 09:26:17,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 641 transitions. [2024-11-10 09:26:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:26:17,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:17,830 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:17,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 09:26:17,831 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:17,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 764635481, now seen corresponding path program 1 times [2024-11-10 09:26:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:17,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387533015] [2024-11-10 09:26:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387533015] [2024-11-10 09:26:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387533015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:18,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:26:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933389636] [2024-11-10 09:26:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:18,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:26:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:26:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:26:18,087 INFO L87 Difference]: Start difference. First operand 495 states and 641 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:18,329 INFO L93 Difference]: Finished difference Result 1070 states and 1376 transitions. [2024-11-10 09:26:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:26:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2024-11-10 09:26:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:18,332 INFO L225 Difference]: With dead ends: 1070 [2024-11-10 09:26:18,332 INFO L226 Difference]: Without dead ends: 578 [2024-11-10 09:26:18,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:26:18,334 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 105 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:18,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 573 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:26:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-10 09:26:18,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 453. [2024-11-10 09:26:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 428 states have (on average 1.2593457943925233) internal successors, (539), 429 states have internal predecessors, (539), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 581 transitions. [2024-11-10 09:26:18,390 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 581 transitions. Word has length 139 [2024-11-10 09:26:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:18,390 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 581 transitions. [2024-11-10 09:26:18,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 09:26:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 581 transitions. [2024-11-10 09:26:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:26:18,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:18,392 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:18,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 09:26:18,392 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:18,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:18,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1713382596, now seen corresponding path program 1 times [2024-11-10 09:26:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:18,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939781160] [2024-11-10 09:26:18,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:18,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939781160] [2024-11-10 09:26:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939781160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:26:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695742876] [2024-11-10 09:26:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:18,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:26:18,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:18,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:26:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:26:18,859 INFO L87 Difference]: Start difference. First operand 453 states and 581 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:19,174 INFO L93 Difference]: Finished difference Result 903 states and 1159 transitions. [2024-11-10 09:26:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:26:19,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2024-11-10 09:26:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:19,177 INFO L225 Difference]: With dead ends: 903 [2024-11-10 09:26:19,177 INFO L226 Difference]: Without dead ends: 453 [2024-11-10 09:26:19,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:26:19,178 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 126 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:19,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 468 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:26:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-10 09:26:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-10 09:26:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 428 states have (on average 1.2570093457943925) internal successors, (538), 429 states have internal predecessors, (538), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:26:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 580 transitions. [2024-11-10 09:26:19,224 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 580 transitions. Word has length 141 [2024-11-10 09:26:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:19,225 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 580 transitions. [2024-11-10 09:26:19,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 580 transitions. [2024-11-10 09:26:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:26:19,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:19,226 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:19,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 09:26:19,227 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:19,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:19,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1744402403, now seen corresponding path program 1 times [2024-11-10 09:26:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:19,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596398157] [2024-11-10 09:26:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:19,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:26:19,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623974803] [2024-11-10 09:26:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:19,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:26:19,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:26:19,323 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) [2024-11-10 09:26:19,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:26:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:19,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-10 09:26:19,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:26:21,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2024-11-10 09:26:22,682 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 [2024-11-10 09:26:23,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:26:23,533 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 17 treesize of output 17 [2024-11-10 09:26:23,836 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 17 treesize of output 13 [2024-11-10 09:26:23,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:26:23,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:26:23,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:26:23,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-10 09:26:24,116 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 28 treesize of output 16 [2024-11-10 09:26:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 2 proven. 326 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-10 09:26:24,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:26:25,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:25,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596398157] [2024-11-10 09:26:25,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:26:25,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623974803] [2024-11-10 09:26:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623974803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:26:25,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:26:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-10 09:26:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144208717] [2024-11-10 09:26:25,449 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 09:26:25,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 09:26:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:25,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 09:26:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2024-11-10 09:26:25,451 INFO L87 Difference]: Start difference. First operand 453 states and 580 transitions. Second operand has 17 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-10 09:26:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:28,258 INFO L93 Difference]: Finished difference Result 1446 states and 1834 transitions. [2024-11-10 09:26:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 09:26:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 141 [2024-11-10 09:26:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:28,262 INFO L225 Difference]: With dead ends: 1446 [2024-11-10 09:26:28,262 INFO L226 Difference]: Without dead ends: 992 [2024-11-10 09:26:28,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 09:26:28,264 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 543 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 40 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:28,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1585 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1049 Invalid, 11 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 09:26:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-11-10 09:26:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 537. [2024-11-10 09:26:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 494 states have (on average 1.2591093117408907) internal successors, (622), 495 states have internal predecessors, (622), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:26:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 694 transitions. [2024-11-10 09:26:28,342 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 694 transitions. Word has length 141 [2024-11-10 09:26:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:28,342 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 694 transitions. [2024-11-10 09:26:28,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-10 09:26:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 694 transitions. [2024-11-10 09:26:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:26:28,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:28,344 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:28,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:26:28,548 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,SelfDestructingSolverStorable27 [2024-11-10 09:26:28,549 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:28,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash -723232954, now seen corresponding path program 1 times [2024-11-10 09:26:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:28,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581508550] [2024-11-10 09:26:28,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581508550] [2024-11-10 09:26:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581508550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:29,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:29,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:26:29,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337500966] [2024-11-10 09:26:29,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:29,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:26:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:29,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:26:29,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:26:29,282 INFO L87 Difference]: Start difference. First operand 537 states and 694 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:29,751 INFO L93 Difference]: Finished difference Result 987 states and 1271 transitions. [2024-11-10 09:26:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:26:29,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2024-11-10 09:26:29,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:29,754 INFO L225 Difference]: With dead ends: 987 [2024-11-10 09:26:29,754 INFO L226 Difference]: Without dead ends: 537 [2024-11-10 09:26:29,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:26:29,755 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 298 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:29,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 470 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:26:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-10 09:26:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2024-11-10 09:26:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 494 states have (on average 1.257085020242915) internal successors, (621), 495 states have internal predecessors, (621), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:26:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 693 transitions. [2024-11-10 09:26:29,843 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 693 transitions. Word has length 141 [2024-11-10 09:26:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:29,843 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 693 transitions. [2024-11-10 09:26:29,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 693 transitions. [2024-11-10 09:26:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:26:29,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:29,846 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:29,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 09:26:29,846 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash -692213147, now seen corresponding path program 1 times [2024-11-10 09:26:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004665425] [2024-11-10 09:26:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:26:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40669023] [2024-11-10 09:26:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:30,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:26:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:26:30,016 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) [2024-11-10 09:26:30,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:26:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:30,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 09:26:30,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:26:31,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2024-11-10 09:26:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 290 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-10 09:26:31,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:26:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004665425] [2024-11-10 09:26:32,632 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 09:26:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40669023] [2024-11-10 09:26:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40669023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:26:32,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:26:32,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-10 09:26:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67596823] [2024-11-10 09:26:32,633 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 09:26:32,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:26:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:26:32,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=257, Unknown=7, NotChecked=0, Total=342 [2024-11-10 09:26:32,634 INFO L87 Difference]: Start difference. First operand 537 states and 693 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-10 09:26:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:33,324 INFO L93 Difference]: Finished difference Result 1199 states and 1533 transitions. [2024-11-10 09:26:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 09:26:33,325 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 141 [2024-11-10 09:26:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:33,327 INFO L225 Difference]: With dead ends: 1199 [2024-11-10 09:26:33,327 INFO L226 Difference]: Without dead ends: 732 [2024-11-10 09:26:33,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=676, Unknown=7, NotChecked=0, Total=930 [2024-11-10 09:26:33,329 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 216 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:33,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 957 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:26:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-10 09:26:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 520. [2024-11-10 09:26:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 477 states have (on average 1.2536687631027255) internal successors, (598), 478 states have internal predecessors, (598), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:26:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 670 transitions. [2024-11-10 09:26:33,426 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 670 transitions. Word has length 141 [2024-11-10 09:26:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:33,426 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 670 transitions. [2024-11-10 09:26:33,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-10 09:26:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 670 transitions. [2024-11-10 09:26:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:26:33,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:33,427 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:33,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 09:26:33,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:26:33,629 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:33,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2044530380, now seen corresponding path program 1 times [2024-11-10 09:26:33,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:33,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908203057] [2024-11-10 09:26:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:33,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:26:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:26:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:26:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:26:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:26:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:26:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:26:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:26:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:26:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:26:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:26:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:26:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:26:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:26:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:26:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:26:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 09:26:34,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:26:34,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908203057] [2024-11-10 09:26:34,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908203057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:26:34,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:26:34,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:26:34,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302967149] [2024-11-10 09:26:34,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:26:34,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:26:34,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:26:34,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:26:34,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:26:34,343 INFO L87 Difference]: Start difference. First operand 520 states and 670 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:26:34,745 INFO L93 Difference]: Finished difference Result 970 states and 1246 transitions. [2024-11-10 09:26:34,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:26:34,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2024-11-10 09:26:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:26:34,748 INFO L225 Difference]: With dead ends: 970 [2024-11-10 09:26:34,748 INFO L226 Difference]: Without dead ends: 520 [2024-11-10 09:26:34,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:26:34,750 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 316 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:26:34,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 455 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:26:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-10 09:26:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-11-10 09:26:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 477 states have (on average 1.251572327044025) internal successors, (597), 478 states have internal predecessors, (597), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:26:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 669 transitions. [2024-11-10 09:26:34,844 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 669 transitions. Word has length 141 [2024-11-10 09:26:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:26:34,844 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 669 transitions. [2024-11-10 09:26:34,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 09:26:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 669 transitions. [2024-11-10 09:26:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:26:34,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:26:34,846 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:34,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 09:26:34,846 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:26:34,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:26:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2075550187, now seen corresponding path program 1 times [2024-11-10 09:26:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:26:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009253528] [2024-11-10 09:26:34,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:26:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 09:26:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153682086] [2024-11-10 09:26:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:26:34,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:26:34,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:26:34,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:26:34,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 09:26:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:26:35,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:26:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:26:36,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:26:36,319 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:26:36,320 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:26:36,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 09:26:36,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:26:36,525 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:26:36,689 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:26:36,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:26:36 BoogieIcfgContainer [2024-11-10 09:26:36,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:26:36,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:26:36,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:26:36,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:26:36,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:25:36" (3/4) ... [2024-11-10 09:26:36,696 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:26:36,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:26:36,699 INFO L158 Benchmark]: Toolchain (without parser) took 61505.79ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 121.0MB in the beginning and 684.7MB in the end (delta: -563.7MB). Peak memory consumption was 370.6MB. Max. memory is 16.1GB. [2024-11-10 09:26:36,701 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 75.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:26:36,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.09ms. Allocated memory is still 155.2MB. Free memory was 121.0MB in the beginning and 103.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 09:26:36,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.40ms. Allocated memory is still 155.2MB. Free memory was 103.1MB in the beginning and 99.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:26:36,701 INFO L158 Benchmark]: Boogie Preprocessor took 81.37ms. Allocated memory is still 155.2MB. Free memory was 99.0MB in the beginning and 93.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:26:36,701 INFO L158 Benchmark]: IcfgBuilder took 937.65ms. Allocated memory is still 155.2MB. Free memory was 93.8MB in the beginning and 111.2MB in the end (delta: -17.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-10 09:26:36,701 INFO L158 Benchmark]: TraceAbstraction took 60028.81ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 110.1MB in the beginning and 684.7MB in the end (delta: -574.6MB). Peak memory consumption was 360.8MB. Max. memory is 16.1GB. [2024-11-10 09:26:36,702 INFO L158 Benchmark]: Witness Printer took 5.17ms. Allocated memory is still 1.1GB. Free memory is still 684.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:26:36,702 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.20ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 75.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.09ms. Allocated memory is still 155.2MB. Free memory was 121.0MB in the beginning and 103.1MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.40ms. Allocated memory is still 155.2MB. Free memory was 103.1MB in the beginning and 99.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.37ms. Allocated memory is still 155.2MB. Free memory was 99.0MB in the beginning and 93.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 937.65ms. Allocated memory is still 155.2MB. Free memory was 93.8MB in the beginning and 111.2MB in the end (delta: -17.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 60028.81ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 110.1MB in the beginning and 684.7MB in the end (delta: -574.6MB). Peak memory consumption was 360.8MB. Max. memory is 16.1GB. * Witness Printer took 5.17ms. Allocated memory is still 1.1GB. Free memory is still 684.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L25] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0][0]); [L26] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1][0]); [L27] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[0][1]); [L28] float* float_Array_0_arrayfloat_Array_0arrayVar3_Pointer = &(float_Array_0[1][1]); [L29-L31] signed short int signed_short_int_Array_0[1] = { -25 }; [L29-L31] signed short int signed_short_int_Array_0[1] = { -25 }; [L32] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L33-L35] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L36] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0][0]); [L37] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1][0]); [L38] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[0][1]); [L39] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer = &(unsigned_char_Array_0[1][1]); [L40-L42] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L40-L42] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L43] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L44] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer = &(unsigned_long_int_Array_0[1]); [L45-L47] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L45-L47] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L45-L47] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L48] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L49] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L50] unsigned char last_1_unsigned_char_Array_0_1__1_ = 0; [L51] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 10; VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=0, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR unsigned_char_Array_0[1][1] [L102] last_1_unsigned_char_Array_0_1__1_ = unsigned_char_Array_0[1][1] [L103] EXPR unsigned_long_int_Array_0[0] [L103] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L77] float_Array_0[0][0] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[0][0] [L78] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L78] EXPR float_Array_0[0][0] [L78] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L78] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L79] float_Array_0[1][0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1][0] [L80] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L80] EXPR float_Array_0[1][0] [L80] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L80] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] EXPR float_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] CALL assume_abort_if_not(float_Array_0[1][0] != 0.0F) 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L81] RET assume_abort_if_not(float_Array_0[1][0] != 0.0F) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L82] float_Array_0[0][1] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[0][1] [L83] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L83] EXPR float_Array_0[0][1] [L83] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L83] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L84] float_Array_0[1][1] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[1][1] [L85] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L85] EXPR float_Array_0[1][1] [L85] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L85] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] EXPR float_Array_0[1][1] VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] CALL assume_abort_if_not(float_Array_0[1][1] != 0.0F) 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L86] RET assume_abort_if_not(float_Array_0[1][1] != 0.0F) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L87] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L88] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L90] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L90] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L90] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L91] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1][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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L93] EXPR unsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L94] unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L96] EXPR unsigned_char_Array_0[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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L97] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L98] EXPR unsigned_long_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L98] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L98] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L99] EXPR unsigned_long_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L99] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L99] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L114] RET updateVariables() [L115] CALL step() [L55] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L55] unsigned long int stepLocal_2 = last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)); [L56] COND TRUE stepLocal_2 != (last_1_unsigned_char_Array_0_1__1_ - 64) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L57] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L57] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L61] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L61] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) [L61] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L61] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L61] COND TRUE (- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))))) [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L62] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) [L62] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L62] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L62] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) = (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))) [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L66] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) [L67] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L67] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) [L68] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L68] signed long int stepLocal_1 = - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)); [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L69] signed long int stepLocal_0 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)); [L70] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L70] COND FALSE !(stepLocal_0 >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L106] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1 [L106] EXPR (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1 VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) [L106] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L106] EXPR ((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) [L106] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L106] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L106] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) [L106] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L106] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L106] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L106] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L106] EXPR ((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR ((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106] EXPR (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) VAL [float_Array_0={4:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={4:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={4:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [L106-L107] return (((((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) >= (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? (((- (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))))) : 1) : 1) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))))) && (((last_1_unsigned_long_int_Array_0_0_ / (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && (((- ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) / 0.6f)) > (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 3.25f) / (((((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (500u + (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))))))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ; [L116] RET, EXPR property() [L116] 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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] [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:8}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={4:4}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={4:12}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={5:0}, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={6:3}, unsigned_long_int_Array_0={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={7:4}, unsigned_short_int_Array_0={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={8:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.8s, OverallIterations: 32, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 8240 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8240 mSDsluCounter, 27442 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21838 mSDsCounter, 985 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10842 IncrementalHoareTripleChecker+Invalid, 11838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 985 mSolverCounterUnsat, 5604 mSDtfsCounter, 10842 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1713 GetRequests, 1337 SyntacticMatches, 2 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=537occurred in iteration=28, InterpolantAutomatonStates: 256, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 3231 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 4804 NumberOfCodeBlocks, 4804 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4209 ConstructedInterpolants, 3 QuantifiedInterpolants, 40782 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1114 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 31 InterpolantComputations, 29 PerfectInterpolantSequences, 12404/13020 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:26:36,875 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...